Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph-Theoretic Concepts in Computer Science

WG 2002: Graph-Theoretic Concepts in Computer Science pp 1–12Cite as

Maximum Cardinality Search for Computing Minimal Triangulations

  • Conference paper
  • First Online:

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

Abstract

We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: Lex-M and MCS. Lex-M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that also computes a minimal triangulation of an arbitrary graph. MCS simplified the fundamental concept used in Lex-BFS, resulting in a simpler algorithm for recognizing chordal graphs. The new simpler algorithm MCS-M combines the extension of Lex-M with the simplification of MCS, achieving all the results of Lex-M in the same time complexity.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Berry, A wide-range efficient algorithm for minimal triangulation, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999.

    Google Scholar 

  2. J. R. S. Blair, P. Heggernes, and J. A. Telle, A practical algorithm for making filled graphs minimal, Theoretical Computer Science, 250 (2001), pp. 125–141.

    Article  MATH  MathSciNet  Google Scholar 

  3. E. Dahlhaus, Minimal elimination ordering inside a given chordal graph, in Graph Theoretical Concepts in Computer Science-WG’ 97, R. H. Möhring, ed., Springer Verlag, 1997, pp. 132–143. Lecture Notes in Computer Science 1335.

    Chapter  Google Scholar 

  4. D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific J. Math., 15 (1965), pp. 835–855.

    MATH  MathSciNet  Google Scholar 

  5. T. Ohtsuki, A fast algorithm for.nding an optimal ordering in the vertex elimination on a graph, SIAM J. Comput., 5 (1976), pp. 133–145.

    Article  MATH  MathSciNet  Google Scholar 

  6. T. Ohtsuki, L. K. Cheung, and T. Fujisawa, Minimal triangulation of a graph and optimal pivoting ordering in a sparse matrix, J. Math. Anal. Appl., 54 (1976), pp. 622–633.

    Article  MATH  MathSciNet  Google Scholar 

  7. S. Parter, The use of linear graphs in Gauss elimination, SIAM Review, 3 (1961), pp. 119–130.

    Article  MATH  MathSciNet  Google Scholar 

  8. B. Peyton, Minimal orderings revisited, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 271–294.

    Article  MATH  MathSciNet  Google Scholar 

  9. D. J. Rose, R. E. Tarjan, and G. S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266–283.

    Article  MATH  MathSciNet  Google Scholar 

  10. R. E. Tarjan and M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput., 13 (1984), pp. 566–579.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Alg. Disc. Meth., 2 (1981), pp. 77–79.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIMOS, Universite Clermont-Ferrand II, F-63177, Aubiere, France

    Anne Berry

  2. US Military Academy, West Point, NY, USA

    Jean R. S. Blair

  3. Informatics, University of Bergen, N-5020, Bergen, Norway

    Pinar Heggernes

Authors
  1. Anne Berry
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean R. S. Blair
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pinar Heggernes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Karlsruhe University, Germany

    Gerhard Goos

  2. Cornell University, NY, USA

    Juris Hartmanis

  3. Utrecht University, The Netherlands

    Jan van Leeuwen

  4. Department of Applied Mathematics, Charles University, Malostranské nám. 25, 118 00, Prague, Czech Republic

    Luděk Kučera

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berry, A., Blair, J.R.S., Heggernes, P. (2002). Maximum Cardinality Search for Computing Minimal Triangulations. In: Goos, G., Hartmanis, J., van Leeuwen, J., Kučera, L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2002. Lecture Notes in Computer Science, vol 2573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-36379-3_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00331-1

  • Online ISBN: 978-3-540-36379-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation