Skip to main content
SpringerLink
Log in

How to use the minimal separators of a graph for its chordal triangulation

  • Algorithms I
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1995)

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

Included in the following conference series:

Abstract

We prove a 1-1 correspondence between maximal sets of pairwise parallel minimal separators of a graph and its minimal chordal triangulations. This yields polynomial-time algorithms to determine the minimum fill-in and the treewidth in several graph classes. We apply the approach to d-trapezoid graphs for which we give the first polynomialtime algorithms that determine the minimum fill-in resp. the treewidth.

The research of this author has been supported by the graduate school “Algorithmic Discrete Mathematics” by the Deutsche Forschungsgemeinschaft, grant We 1265/2-1.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, M.R. Garey, J.D. Ullman: The transitive reduction of a directed graph. SIAM J. Comput. 1 (1972) 131–137

    Google Scholar 

  2. S. Arnborg, D.G. Corneil, A. Proskurowski: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Meth. 8 (1987) 277–284

    Google Scholar 

  3. S. Arnborg, J. Lagergren, D. Seese: Easy problems for tree-decomposable graphs. J. Algorithms 12 (1991) 308–340

    Google Scholar 

  4. H. Bodlaender, T. Kloks, D. Kratsch: Treewidth and pathwidth of permutation graphs. Proc. 20th ICALP, LNCS 700. Berlin: Springer 1993, 114–125

    Google Scholar 

  5. H. Bodlaender, R.H. Möhring: The pathwidth and treewidth of cographs. SIAM J. Discrete Math. 6 (1993) 181–188

    Google Scholar 

  6. H. Bodlaender: A linear time algorithm for finding tree-decompositions of small treewidth. Proc. 25th STOC 1993, 226–234

    Google Scholar 

  7. H. Bodlaender: A tourist guide through treewidth. Acta Cybernetica 11 (1993) 1–23

    Google Scholar 

  8. D. Coppersmith, S. Winograd: Matrix multiplication via arithmetic progressions. Proc. 19th STOC 1987, 1–6

    Google Scholar 

  9. D.G. Corneil, Y. Perl, L. Stewart: Cographs: recognition, applications and algorithms. Congr. Numer. 43 (1984) 249–258

    Google Scholar 

  10. I. Dagan, M.C. Golumbic, I. Pinter: Trapezoid graphs and their coloring. Discrete Appl. Math. 21 (1988) 35–46

    Google Scholar 

  11. G.A. Dirac: On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg 25(1961)71–76

    Google Scholar 

  12. S. Felsner, R. Müller, L. Wernisch: Optimal algorithms for trapezoid graphs. Technical Report 368/1993, Technische UniversitÄt Berlin, 1993

    Google Scholar 

  13. C. Flotow: On powers of m-trapezoid graphs. Technical Report, UniversitÄt Hamburg, Fachbereich Mathematik, 1993

    Google Scholar 

  14. M.C. Golumbic: Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press 1980

    Google Scholar 

  15. M. Habib, D. Kelly, R.H. Möhring: Interval dimension is a comparability invariant. Discrete Math. 88 (1991) 211–229

    Google Scholar 

  16. T. Kloks: Treewidth of circle graphs. Proc. 4th ISAAC, Lecture Notes in Computer Science 762. Berlin: Springer 1993, 108–117

    Google Scholar 

  17. T. Kloks, H. Bodlaender, H. Müller, D. Kratsch: Computing treewidth and minimum fill-in: All you need are the minimal separators. Proc. 1st ESA, LNCS 726. Berlin: Springer 1993, 260–271

    Google Scholar 

  18. T. Kloks, H. Bodlaender, H. Müller, D. Kratsch: Erratum to the ESA'93 Proceedings. Proc. 2nd ESA, LNCS 855. Berlin: Springer 1994, p. 508

    Google Scholar 

  19. T. Kloks, D. Kratsch: Finding all minimal separators of a graph. Proc. 11th STACS, Lecture Notes in Computer Science 775. Berlin: Springer 1994, 759–768

    Google Scholar 

  20. T. Kloks, D. Kratsch, J. Spinrad: Treewidth and pathwidth of cocomparability graphs of bounded dimension. Technical Report 93/46, Eindhoven University, 1993

    Google Scholar 

  21. T. Kloks: Treewidth. Computations and Approximations. Lecture Notes in Computer Science 842. Berlin: Springer 1994

    Google Scholar 

  22. T. Ma, J. Spinrad: An O(n 2) time algorithm for the 2-chain cover problem and related problems. Proc. 2nd SODA 1991, 363–372

    Google Scholar 

  23. R.H Möhring: Algorithmic aspects of comparability graphs and interval graphs. In: I. Rival (ed.): Graphs and Order. Dordrecht: Kluwer Academic Publ. 1985, 41–101

    Google Scholar 

  24. R.H. Möhring: Graph problems related to gate matrix layout and PLA folding. In: G. Tinhofer, E. Mayr, H. Noltemeier, M. Sysło (eds.): Computational Graph Theory. Wien, New York: Springer 1990, 17–52

    Google Scholar 

  25. R.H. Möhring: Triangulating graphs without asteroidal triples. Technical Report 365/1993, Technische UniversitÄt Berlin, 1993

    Google Scholar 

  26. A. Parra: Triangulating multitolerance graphs. Technical Report 392/1994, Technische UniversitÄt Berlin, 1994

    Google Scholar 

  27. P. Scheffler: Dynamic programming algorithms for tree-decomposition problems. Technical Report P-MATH-28/86, Weierstra\-Institut f. Mathematik Berlin, 1986

    Google Scholar 

  28. J. Spinrad, A. BrandstÄdt, L. Stewart: Bipartite permutation graphs. Discrete Appl. Math. 18 (1987) 279–292

    Google Scholar 

  29. R. Sundaram, K.S. Singh, C. Pandu Rangan: Treewidth of circular-arc graphs. SIAM J. Discrete Math. 7 (1994) 647–655

    Google Scholar 

  30. M. Yannakakis: Computing the minimum fill-in is NP-complete. SIAM J. Algebraic Discrete Meth. 2 (1981) 77–79

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. TU Berlin, MA 6-1, D-10623, Berlin, Germany

    Andreas Parra & Petra Scheffler

Authors
  1. Andreas Parra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petra Scheffler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Fülöp Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parra, A., Scheffler, P. (1995). How to use the minimal separators of a graph for its chordal triangulation. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-60084-1_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60084-8

  • Online ISBN: 978-3-540-49425-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation