Skip to main content
SpringerLink
Log in

Treewidth and Minimum Fill-In of Weakly Triangulated Graphs

  • Conference paper
  • First Online:
STACS 99 (STACS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1563))

Included in the following conference series:

Abstract

We use the notion of potential maximal clique to characterize the maximal cliques appearing in minimal triangulations of a graph. We show that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum fill-in are polynomially tractable for these graphs. Finally we show how to compute in polynomial time the potential maximal cliques of weakly triangulated graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Bouchitté and I. Todinca. Minimal triangulations for graphs with ” few” minimal separators. In Proceedings 6th Annual European Symposium on Algorithms (ESA’98), volume 1461 of Lecture Notes in Computer Science, pages 344–355. Springer-Verlag, 1998.

    Google Scholar 

  2. H.J. Broersma, E. Dahlhaus, and T. Kloks. Algorithms for the treewidth and minimum fill-in of HHD-free graphs. In Workshop on Graphs (WG’97), volume 1335 of Lecture Notes in Computer Science, pages 109–117. Springer-Verlag, 1997.

    Google Scholar 

  3. M. S. Chang. Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs. In ISAAC’96, volume 1178 of Lecture Notes in Computer Science, pages 146–155. Springer-Verlag, 1996.

    Google Scholar 

  4. G.A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 21:71–76, 1961.

    Article  MathSciNet  Google Scholar 

  5. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.

    MATH  Google Scholar 

  6. R. Hayward. Weakly triangulated graphs. J. Combin. Theory ser. B, 39:200–208, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  7. R. Hayward, C. Hoàng, and F. Maffray. Optimizing weakly triangulated graphs. Graphs Combin., 5:339–349, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  8. T. Kloks. Treewidth of circle graphs. In Proceedings 4th Annual International Symposium on Algorithms and Computation (ISAAC’93), volume 762 of Lecture Notes in Computer Science, pages 108–117. Springer-Verlag, 1993.

    Google Scholar 

  9. T. Kloks, 1998. Private communication.

    Google Scholar 

  10. T. Kloks, H.L. Bodlaender, H. Müller, and D. Kratsch. Computing treewidth and minimum fill-in: All you need are the minimal separators. In Proceedings First Annual European Symposium on Algorithms (ESA’93), volume 726 of Lecture Notes in Computer Science, pages 260–271. Springer-Verlag, 1993.

    Google Scholar 

  11. T. Kloks, H.L. Bodlaender, H. Müller, and D. Kratsch. Erratum to the ESA’93 proceedings. In Proceedings Second Annual European Symposium on Algorithms (ESA’94), volume 855 of Lecture Notes in Computer Science, page 508. Springer-Verlag, 1994.

    Google Scholar 

  12. T. Kloks and D. Kratsch. Treewidth of chordal bipartite graphs. J. Algorithms, 19(2):266–281, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  13. T. Kloks, D. Kratsch, and H. Müller. Approximating the bandwidth for asteroidal triple-free graphs. In Proceedings Third Annual European Symposium on Algorithms (ESA’95), volume 979 of Lecture Notes in Computer Science, pages 434–447. Springer-Verlag, 1995.

    Google Scholar 

  14. T. Kloks, D. Kratsch, and J. Spinrad. On treewidth and minimum fill-in of asteroidal triple-free graphs. Theoretical Computer Science, 175:309–335, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  15. T. Kloks, D. Kratsch, and C.K. Wong. Minimum fill-in of circle and circular-arc graphs. J. Algorithms, 28(2):272–289, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  16. A. Parra and P. Scheffler. Characterizations and algorithmic applications of chordal graph embeddings. Discrete Appl. Math., 79(1–3):171–188, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  17. N. Robertson and P. Seymour. Graphs minors. II. Algorithmic aspects of tree-width. J. of Algorithms, 7:309–322, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  18. J. Spinrad and R. Sritharan. Algorithms for weakly triangulated graphs. Discrete Applied Mathematics, 59:181–191, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  19. R. Sundaram, K. Sher Singh, and C. Pandu Rangan. Treewidth of circular-arc graphs. SIAM J. Discrete Math., 7:647–655, 1994.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIP-École Normale Supérieure de Lyon, 46 Allée d’Italie, 69364, Lyon Cedex 07, France

    Vincent Bouchitté & Ioan Todinca

Authors
  1. Vincent Bouchitté
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ioan Todinca
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. FB IV - Informatik, Universität Trier, D-54286, Trier, Germany

    Christoph Meinel

  2. LIFL, Université de Lille I, Bătiment 3, F-59655, Villeneuve d’Ascq Cedex, France

    Sophie Tison

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouchitté, V., Todinca, I. (1999). Treewidth and Minimum Fill-In of Weakly Triangulated Graphs. In: Meinel, C., Tison, S. (eds) STACS 99. STACS 1999. Lecture Notes in Computer Science, vol 1563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49116-3_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-49116-3_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65691-3

  • Online ISBN: 978-3-540-49116-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation