IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/595.html
   My bibliography  Save this paper

Algorithms for maximum weight cliques, minimum weighted clique covers and minimum colorings of claw-free perfect graphs

Author

Listed:
  • HSU, Wen-Lian
  • NEMHAUSER, George L.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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).
    • Handle: RePEc:cor:louvrp:595
    DOI: 10.1016/S0304-0208(08)72944-X
    Note: In : Annals of Discrete Mathematics, 21, 357-369, 1984
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    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. 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.
    3. Frédéric Maffray & Nicolas Trotignon & Kristina Vuskovic, 2006. "Algorithms for square-3PC(.,.)-free Berge graphs," Post-Print halshs-00130439, HAL.

    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:cor:louvrp:595. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    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.