IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v188y2011i1p133-13910.1007-s10479-010-0792-0.html
   My bibliography  Save this article

The chain graph sandwich problem

Author

Listed:
  • Simone Dantas
  • Celina Figueiredo
  • Martin Golumbic
  • Sulamita Klein
  • Frédéric Maffray

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

Suggested Citation

  • Simone Dantas & Celina Figueiredo & Martin Golumbic & Sulamita Klein & Frédéric Maffray, 2011. "The chain graph sandwich problem," Annals of Operations Research, Springer, vol. 188(1), pages 133-139, August.
    • Handle: RePEc:spr:annopr:v:188:y:2011:i:1:p:133-139:10.1007/s10479-010-0792-0
    DOI: 10.1007/s10479-010-0792-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0792-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-010-0792-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gorlin, Yury & Maleva, Tatyana & Nazarov, Vladimir & Grishina, Elena & Fedorov, Valery & Kirillova, M., "undated". "Development of Pension Formula for Calculation of Solidary Part Based on Stimulation to Later Retirement," Published Papers nvg178, Russian Presidential Academy of National Economy and Public Administration.
    2. José D. Alvarado & Simone Dantas & Dieter Rautenbach, 2019. "Sandwiches missing two ingredients of order four," Annals of Operations Research, Springer, vol. 280(1), pages 47-63, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:188:y:2011:i:1:p:133-139:10.1007/s10479-010-0792-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.