Minimal triangulations of graphs: A survey

Discrete Mathematics

Volumn 306, Issue 3, 2006, Pages 297-317

  Heggernes, Pinar ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Chordal graphs; Minimal fill; Minimal triangulation

Indexed keywords

ALGORITHMS; CHARACTERIZATION; MATRIX ALGEBRA; SURVEYS; TRIANGULATION;

CHORDAL GRAPHS; MINIMAL FILL; MINIMAL TRIANGULATION;

GRAPH THEORY;

EID: 33344477330     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.12.003     Document Type: Article

References (84)

1. S. Arikati, and P. Rangan An efficient algorithm for finding a two-pair, and its applications Discrete Appl. Math. 31 1991 71 74
2. S. Arnborg, D.G. Corneil, and A. Proskurowski Complexity of finding embeddings in a k -tree SIAM J. Algebraic Discrete Methods 8 1987 277 284
3. E. Balas A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring Discrete Appl. Math. 15 1986 123 134
4. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis On the desirability of acyclic database systems J. Assoc. Comput. Mach. 30 1983 479 513
5. A. Berry, Désarticulation d'un graphe, Ph.D. Thesis, LIRMM, Montpellier, France, 1998.
6. A. Berry A wide-range efficient algorithm for minimal triangulation Proceedings of the Tenth Annual ACM SIAM Symposium on Discrete Algorithms (SODA'99) 1999 S860 S861
7. A. Berry, J.R.S. Blair, P. Heggernes, and B.W. Peyton Maximum cardinality search for computing minimal triangulations of graphs Algorithmica 39 4 2004 287 298
8. A. Berry, and J.-P. Bordat Separability generalizes Dirac's theorem Discrete Appl. Math. 84 1998 43 53
9. A. Berry, J.P. Bordat, and O. Cogis Generating all the minimal separators of a graph Internat. J. Foundations Comput. Sci. 11 3 2000 397 403
10. A. Berry, J.-P. Bordat, P. Heggernes, G. Simonet, and Y. Villanger A wide-range algorithm for minimal triangulation from an arbitrary ordering J. Algorithms 58 1 2006 33 66
11. A. Berry, P. Heggernes, G. Simonet, The minimum degree heuristic and the minimal triangulation process, Proceedings of the 29th Workshop on Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 2880, Springer, Berlin, 2003, pp. 58-70.
12. A. Berry, P. Heggernes, Y. Villanger, A vertex incremental approach for dynamically maintaining chordal graphs, in: Algorithms and Computation - ISAAC 2003, Lecture Notes in Computer Science, vol. 2906, Springer, Berlin, 2003, pp. 47-57.
13. J.R.S. Blair, P. Heggernes, and J.A. Telle A practical algorithm for making filled graphs minimal Theoret. Comput. Sci. 250 2001 125 141
14. J.R.S. Blair, B.W. Peyton, An introduction to chordal graphs and clique trees, in: J.A. George, J.R. Gilbert, J.W.H. Liu (Eds.), Sparse matrix computations: graph theory issues and algorithms, IMA Volumes in Mathematics and its Applications, vol. 56, Springer, Berlin, 1993, pp. 1-30.
15. H.L. Bodlaender A tourist guide through treewidth Acta Cybernet. 11 1993 1 21
16. H.L. Bodlaender, T. Kloks, D. Kratsch, and H. Müller Treewidth and minimum fill-in on d -trapezoid graphs J. Graph Alg. Appl. 2 1998 1 23
17. H.L. Bodlaender, A.M.C.A. Koster, Safe separators for treewidth, Technical Report UU-CS-2003-027, Institute of Information and Computing Sciences, Utrecht University, Netherlands, 2002.
18. C.F. Bornstein, B.M. Maggs, and G.L. Miller Tradeoffs between parallelism and fill in nested dissection SPAA 99 - Eleventh ACM Symposium on Parallel Algorithms and Architectures 1999 191 200
19. V. Bouchitté, and I. Todinca Treewidth and minimum fill in: grouping the minimal separators SIAM J. Comput. 31 2001 212 232
20. V. Bouchitté, and I. Todinca Listing all potential maximal cliques of a graph Theoret. Comput. Sci. 276 1-2 2002 17 32
21. H.J. Broersma, E. Dahlhaus, and T. Kloks A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs Discrete Appl. Math. 99 2000 367 400
22. P. Buneman A characterization of rigid circuit graphs Discrete Math. 9 1974 205 212
23. L. Cai Fixed-parameter tractability of graph modification problems for hereditary properties Inform. Process. Lett. 58 4 1996 171 176
24. N. Chandrasekharan, and S.S. Iyengar NC algorithms for recognizing chordal graphs and k -trees IEEE Trans. Comput. 37 10 1988 1178 1183
25. F.R.K. Chung, and D. Mumford Chordal completions of planar graphs J. Combin. Theory 31 1994 96 106
26. D. Coppersmith, and S. Winograd Matrix multiplication via arithmetic progressions J. Symbolic Comput. 9 1990 1 6
27. D.G. Corneil, S. Olariu, and L. Stewart Asteroidal triple-free graphs SIAM J. Discrete Math. 10 1997 399 430
28. E. Dahlhaus The parallel complexity of elimination ordering procedures Graph Theoretic Concepts in Computer Science - WG '93 1993 Springer Berlin 225 236
29. E. Dahlhaus, Minimal elimination ordering inside a given chordal graph, in: Graph Theoretical Concepts in Computer Science - WG'97, Lecture Notes in Computer Science, vol. 1335, Springer, Berlin, 1997, pp. 132-143.
30. E. Dahlhaus, Minimal elimination of planar graphs, in: S. Arnborg, L. Ivansson (Eds.), Algorithm Theory - SWAT 1998, Lecture Notes in Computer Science, vol. 1432, Springer, Berlin, 1998, pp. 210-221.
31. E. Dahlhaus, An improved linear time algorithm for minimal elimination ordering in planar graphs that is parallelizable, Technical report TR-465-99, ALCOM-IT European Union ESPRIT LTR Project 20244, 1999.
32. E. Dahlhaus, Converting a Nested Dissection into a minimal elimination ordering efficiently, 2000, unpublished manuscript.
33. E. Dahlhaus Minimal elimination ordering for graphs of bounded degree Discrete Appl. Math. 116 2002 127 143
34. E. Dahlhaus, and M. Karpinski An efficient parallel algorithm for the minimal elimination ordering of an arbitrary graph Theoret. Comput. Sci. 134 2 1994 493 528
35. E. Dahlhaus, M. Karpinski, and M. Novick Fast parallel algorithms for the clique separator decomposition SODA: ACM-SIAM Symposium on Discrete Algorithms 1990
36. P.M. Dearing, D.R. Shier, and D.D. Warner Maximal chordal subgraphs Discrete Appl. Math. 20 1988 181 190
37. G.A. Dirac On rigid circuit graphs Anh. Math. Sem. Univ. Hamburg 25 1961 71 76
38. A. Edenbrandt Chordal graph recognition is in NC Inform. Process. Lett. 24 1987 239 241
39. F.V. Fomin, D. Kratsch, I. Todinca, Exact (exponential) algorithms for treewidth and minimum fill-in, in: Automata, Languages and Programming - ICALP 2004, Lecture Notes in Computer Science, vol. 3142, Springer, Berlin, 2004, pp. 568-580.
40. D.R. Fulkerson, and O.A. Gross Incidence matrices and interval graphs Pacific J. Math. 15 1965 835 855
41. M.R. Garey, and D.S. Johnson Computers and Intractability 1978 Freeman
42. F. Gavril The intersection graphs of subtrees in trees are exactly the chordal graphs J. Combin. Theory Ser. B 16 1974 47 56
43. J.A. George Nested dissection of a regular finite element mesh SIAM J. Numer. Anal. 10 1973 345 363
44. J.A. George, and J.W.H. Liu Computer Solution of Large Sparse Positive Definite Systems 1981 Prentice-Hall Englewood Cliffs, New Jersey
45. P.W. Goldberg, M.C. Golumbic, H. Kaplan, and R. Shamir Four strikes against physical mapping of DNA J. Comput. Biol. 2 1 1995 139 152
46. M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press
47. M.C. Golumbic, C.L. Monma, and W.T. Trotter Jr. Tolerance graphs Discrete Appl. Math. 9 2 1984 157 170
48. A. Hajnal, J. Surányi, Über die Ausflösung von Graphen in vollständige Teilgraphen, Ann. Univ. Sci. Budapest (1958) 113-121.
49. P. Heggernes, S. Eisenstat, G. Kumfert, and A. Pothen The computational complexity of the minimum degree algorithm Proceedings of NIK 2001 - 14th Norwegian Computer Science Conference 2001 98 109 Also available as ICASE Report 2001-42, NASA/CR-2001-211421, NASA Langley Research Center, USA
50. P. Heggernes, J.A. Telle, and Y. Villanger Computing minimal triangulations in time O (n α log n ) = o (n 2.376 ) SIAM J. Disc. Math. 19 4 2005 900 913
51. P. Heggernes, Y. Villanger, Efficient implementation of a minimal triangulation algorithm, in: Algorithms - ESA 2002, Lecture Notes in Computer Science, vol. 2461, Springer, Berlin, 2002, pp. 550-561.
52. C.W. Ho, and R.C.T. Lee Counting clique trees and computing perfect elimination schemes in parallel Inform. Process. Lett. 31 1989 61 68
53. L. Ibarra Fully dynamic algorithms for chordal graphs Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms 1999
54. H. Kaplan, R. Shamir, and R.E. Tarjan Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs SIAM J. Comput. 28 5 1999 1906 1922
55. T. Kloks, H.L. Bodlaender, H. Müller, D. Kratsch, Computing treewidth and minimum fill-in: all you need are the minimal separators, in: T. Lengauer (Ed.), Algorithms - ESA 1993, Lecture Notes in Computer Science, vol. 726, Springer, Berlin, 1993, pp. 260-271.
56. T. Kloks, H.L. Bodlaender, H. Müller, D. Kratsch, Erratum to ESA 1993 proceedings, in: Algorithms - ESA 1994, Lecture Notes in Computer Science, vol. 855, Springer, Berlin, 1994, p. 508.
57. T. Kloks, and D. Kratsch Listing all minimal separators of a graph SIAM J. Comput. 27 3 1998 605 613
58. T. Kloks, D. Kratsch, and H. Müller On the structure of graphs with bounded asteroidal number Graphs Combin. 17 2001 295 306
59. T. Kloks, D. Kratsch, and J. Spinrad On treewidth and minimum fill-in of asteroidal triple-free graphs Theoret. Comput. Sci. 175 1997 309 335
60. D. Kratsch, J. Spinrad, Minimal fill in o (n 3 ) time, Discrete Math. in press, 10.1016/j.disc.2005.12.009.
61. D. Kratsch, and L. Stewart Domination on cocomparability graphs SIAM J. Discrete Math. 6 3 1993 400 417
62. S.L. Lauritzen, and D.J. Spiegelhalter Local computations with probabilities on graphical structures and their applications to expert systems J. Roy. Statist. Soc. Ser B 50 1988 157 224
63. C.G. Lekkerkerker, and J.C. Boland Representation of a finite graph by a set of intervals on the real line Fund. Math. 51 1962 45 64
64. J.W.H. Liu Equivalent sparse matrix reorderings by elimination tree rotations SIAM J. Sci. Statist. Comput. 9 3 1988 424 444
65. J.W.H. Liu The role of elimination trees in sparse factorization SIAM J. Matrix Anal. Appl. 11 1 1990 134 172
66. R.M. McConnell, and J.P. Spinrad Modular decomposition and transitive orientation Discrete Appl. Math. 201 1-3 1999 189 241
67. D. Meister, Recognizing and computing minimal triangulations efficiently, Technical Report 302, Julius Maximilians Universität Würzburg, 2002.
68. R.H. Möhring Triangulating graphs without asteroidal triples Discrete Appl. Math. 64 1996 281 287
69. J. Naor, M. Naor, and A. Schäffer Fast parallel algorithms for chordal graphs Proceedings of the 19th Annual ACM conference on Theory of computing 1987 ACM Press 355 364
70. A. Natanzon, R. Shamir, and R. Sharan A polynomial approximation algorithm for the minimum fill-in problem SIAM J. Computing 30 2000 1067 1079
71. A. Natanzon, R. Shamir, and R. Sharan Complexity classification of some edge modification problems Discrete Appl. Math. 113 2001 109 128
72. T. Ohtsuki A fast algorithm for finding an optimal ordering in the vertex elimination on a graph SIAM J. Comput. 5 1976 133 145
73. 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 622 633
74. A. Parra, and P. Scheffler Characterizations and algorithmic applications of chordal graph embeddings Discrete Appl. Math. 79 1997 171 188
75. S. Parter The use of linear graphs in Gauss elimination SIAM Rev. 3 1961 119 130
76. B.W. Peyton Minimal orderings revisited SIAM J. Matrix Anal. Appl. 23 1 2001 271 294
77. N. Robertson, and P. Seymour Graph minors II. Algorithmic aspects of tree-width J. Algorithms 7 1986 309 322
78. D.J. Rose A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations R.C. Read Graph Theory and Computing 1972 Academic Press New York 183 217
79. D. Rose, R.E. Tarjan, and G. Lueker Algorithmic aspects of vertex elimination on graphs SIAM J. Comput. 5 1976 146 160
80. 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 566 579
81. Y. Villanger, Lex M versus MCS-M, Technical Report, University of Bergen, Norway, 2003.
82. J.R. Walter. Representations of rigid cycle graphs, Ph.D. Thesis, Wayne State University, 1972.
83. J. Xue Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem Networks 24 1994 109 120
84. M. Yannakakis Computing the minimum fill-in is NP-complete SIAM J. Algebraic Discrete Methods 2 1981 77 79