The complexity of dissociation set problems in graphs - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2011

The complexity of dissociation set problems in graphs

Y. Orlovich
  • Function : Author
Valery Gordon
  • Function : Author
Frank Werner
  • Function : Author
  • PersonId : 893489

Abstract

A subset of vertices in a graph is called a dissociation set if it induces a subgraph with a vertex degree of at most 1. The maximum dissociation set problem, i.e., the problem of finding a dissociation set of maximum size in a given graph is known to be NP-hard for bipartite graphs. We show that the maximum dissociation set problem is NP-hard for planar line graphs of planar bipartite graphs. In addition, we describe several polynomially solvable cases for the problem under consideration. One of them deals with the subclass of the so-called chair-free graphs. Furthermore, the related problem of finding a maximal (by inclusion) dissociation set of minimum size in a given graph is studied, and NP-hardness results for this problem, namely for weakly chordal and bipartite graphs, are derived. Finally, we provide inapproximability results for the dissociation set problems mentioned above.

Dates and versions

hal-00617109 , version 1 (26-08-2011)

Identifiers

Cite

Y. Orlovich, Alexandre Dolgui, Gerd Finke, Valery Gordon, Frank Werner. The complexity of dissociation set problems in graphs. Discrete Applied Mathematics, 2011, 159 (13), pp.1352-1366. ⟨10.1016/j.dam.2011.04.023⟩. ⟨hal-00617109⟩
157 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More