The chain graph sandwich problem

Simone Dantas (), Celina Figueiredo (), Martin Golumbic (), Sulamita Klein () and Frédéric Maffray ()

Annals of Operations Research, 2011, vol. 188, issue 1, 133-139

Abstract: 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 ⊆E⊆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. Copyright Springer Science+Business Media, LLC 2011

Date: 2011
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-010-0792-0 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:188:y:2011:i:1:p:133-139:10.1007/s10479-010-0792-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-010-0792-0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().