The chain graph sandwich problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of Operations Research Année : 2011

The chain graph sandwich problem

Résumé

The chain graph sandwich problem asks: Given a vertex set $V$, a mandatory edge set $E^1$, and a larger edge set $E^2$, is there a graph $G= (V,E)$ such that $E^1 \subseteq E \subseteq E^2 $ with $G$ being a chain graph (i.e., a $2K_2$-free bipartite graph)? We prove that the chain graph sandwich problem is NP-complete. This result stands in contrast to (1) the case where $E^1$ is a connected graph, which has a linear-time solution, (2) the threshold graph sandwich problem, which has a linear-time solution, and (3) the chain probe graph problem, which has a polynomial-time solution.
Fichier non déposé

Dates et versions

hal-00660303 , version 1 (16-01-2012)

Identifiants

  • HAL Id : hal-00660303 , version 1

Citer

Simone Dantas, Celina M. H. de Figueiredo, Martin C. Golumbic, Sulamita Klein, Frédéric Maffray. The chain graph sandwich problem. Annals of Operations Research, 2011, 188, pp.133-139. ⟨hal-00660303⟩
147 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More