IDEAS home Printed from https://ideas.repec.org/p/hal/cesptp/halshs-00130439.html
   My bibliography  Save this paper

Algorithms for square-3PC(.,.)-free Berge graphs

Author

Listed:
  • Frédéric Maffray

    (Leibniz - IMAG - Laboratoire Leibniz - UJF - Université Joseph Fourier - Grenoble 1 - INPG - Institut National Polytechnique de Grenoble - CNRS - Centre National de la Recherche Scientifique)

  • Nicolas Trotignon

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

  • Kristina Vuskovic

    (School of Computing [Leeds] - University of Leeds)

Abstract

We consider the class of graphs containing no odd hole, no odd antihole and no configuration consisting of three paths between two nodes such that any two of the paths induce a hole and at least two of the paths are of length 2. This class generalizes claw-free Berge graphs and square-free Berge graphs. We give a combinatorial algorithm of complexity O(n7) to find a clique of maximum weight in such a graph. We also consider several subgraph-detection problems related to this class.

Suggested Citation

  • Frédéric Maffray & Nicolas Trotignon & Kristina Vuskovic, 2006. "Algorithms for square-3PC(.,.)-free Berge graphs," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00130439, HAL.
    • Handle: RePEc:hal:cesptp:halshs-00130439
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00130439
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-00130439/document
    Download Restriction: no
    ---><---

    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:hal:cesptp:halshs-00130439. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.