IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v9y2005i4d10.1007_s10878-005-1775-y.html
   My bibliography  Save this article

A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs

Author

Listed:
  • Xueliang Li

    (Nankai University)

  • Wenan Zang

    (University of Hong Kong)

Abstract

We present an O(n5) combinatorial algorithm for the minimum weighted coloring problem on claw-free perfect graphs, which was posed by Hsu and Nemhauser in 1984. Our algorithm heavily relies on the structural descriptions of claw-free perfect graphs given by Chavátal and Sbihi and by Maffray and Reed.

Suggested Citation

  • Xueliang Li & Wenan Zang, 2005. "A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs," Journal of Combinatorial Optimization, Springer, vol. 9(4), pages 331-347, June.
    • Handle: RePEc:spr:jcomop:v:9:y:2005:i:4:d:10.1007_s10878-005-1775-y
    DOI: 10.1007/s10878-005-1775-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-1775-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-005-1775-y?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.

    References listed on IDEAS

    as
    1. HSU, Wen-Lian & NEMHAUSER, George L., 1984. "Algorithms for maximum weight cliques, minimum weighted clique covers and minimum colorings of claw-free perfect graphs," LIDAM Reprints CORE 595, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Vadim Lozin & Christopher Purcell, 2014. "Coloring vertices of claw-free graphs in three colors," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 462-479, August.
    2. Frédéric Maffray & Nicolas Trotignon & Kristina Vuskovic, 2006. "Algorithms for square-3PC(.,.)-free Berge graphs," Cahiers de la Maison des Sciences Economiques b06085, Université Panthéon-Sorbonne (Paris 1).
    3. Frédéric Maffray & Nicolas Trotignon & Kristina Vuskovic, 2006. "Algorithms for square-3PC(.,.)-free Berge graphs," Post-Print halshs-00130439, HAL.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Frédéric Maffray & Nicolas Trotignon & Kristina Vuskovic, 2006. "Algorithms for square-3PC(.,.)-free Berge graphs," Cahiers de la Maison des Sciences Economiques b06085, Université Panthéon-Sorbonne (Paris 1).
    2. Frédéric Maffray & Nicolas Trotignon & Kristina Vuskovic, 2006. "Algorithms for square-3PC(.,.)-free Berge graphs," Post-Print halshs-00130439, HAL.

    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:jcomop:v:9:y:2005:i:4:d:10.1007_s10878-005-1775-y. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.