IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v157y2008i1p47-6010.1007-s10479-007-0190-4.html
   My bibliography  Save this article

Two methods for the generation of chordal graphs

Author

Listed:
  • Lilian Markenzon
  • Oswaldo Vernet
  • Luiz Araujo

Abstract

In this paper two methods for automatic generation of connected chordal graphs are proposed: the first one is based on new results concerning the dynamic maintenance of chordality under edge insertions; the second is based on expansion/merging of maximal cliques. Theoretical and experimental results are presented. In both methods, chordality is preserved along the whole generation process. Copyright Springer Science+Business Media, LLC 2008

Suggested Citation

  • Lilian Markenzon & Oswaldo Vernet & Luiz Araujo, 2008. "Two methods for the generation of chordal graphs," Annals of Operations Research, Springer, vol. 157(1), pages 47-60, January.
    • Handle: RePEc:spr:annopr:v:157:y:2008:i:1:p:47-60:10.1007/s10479-007-0190-4
    DOI: 10.1007/s10479-007-0190-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0190-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0190-4?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. Tınaz Ekim & Mordechai Shalom & Oylum Şeker, 2021. "The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation," Journal of Combinatorial Optimization, Springer, vol. 41(3), pages 710-735, April.
    2. Şeker, Oylum & Ekim, Tınaz & Taşkın, Z. Caner, 2021. "An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs," European Journal of Operational Research, Elsevier, vol. 291(1), pages 67-83.

    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:157:y:2008:i:1:p:47-60:10.1007/s10479-007-0190-4. 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.