IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v188y2011i1p175-18310.1007-s10479-009-0584-6.html
   My bibliography  Save this article

A characterization of chain probe graphs

Author

Listed:
  • Martin Golumbic
  • Frédéric Maffray
  • Grégory Morel

Abstract

A chain probe graph is a graph that admits an independent set S of vertices and a set F of pairs of elements of S such that G+F is a chain graph (i.e., a 2K 2 -free bipartite graph). We show that chain probe graphs are exactly the bipartite graphs that do not contain as an induced subgraph a member of a family of six forbidden subgraphs, and deduce an O(n 2 ) recognition algorithm. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • Martin Golumbic & Frédéric Maffray & Grégory Morel, 2011. "A characterization of chain probe graphs," Annals of Operations Research, Springer, vol. 188(1), pages 175-183, August.
    • Handle: RePEc:spr:annopr:v:188:y:2011:i:1:p:175-183:10.1007/s10479-009-0584-6
    DOI: 10.1007/s10479-009-0584-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-009-0584-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-009-0584-6?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.

    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:175-183:10.1007/s10479-009-0584-6. 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.