A vertex incremental approach for maintaining chordality

Discrete Mathematics

Volumn 306, Issue 3, 2006, Pages 318-336

  Berry, Anne ^a   Heggernes, Pinar ^b   Villanger, Yngve ^b  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Chordal graphs; Maximal chordal subgraph; Minimal triangulation

Indexed keywords

CHARACTERIZATION; KNOWLEDGE ACQUISITION; PROBLEM SOLVING; TRIANGULATION;

CHORDAL GRAPHS; MAXIMAL CHORDAL SUBGRAPH; MINIMAL TRIANGULATION;

GRAPH THEORY;

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

References (36)

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. E. Balas A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring Discrete Appl. Math. 15 1986 123 134
3. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis On the desirability of acyclic database systems J. Assoc. Comput. Mach. 30 1983 479 513
4. A. Berry, A wide-range efficient algorithm for minimal triangulation, in: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999.
5. A. Berry, J. Blair, P. Heggernes, and B. Peyton Maximum cardinality search for computing minimal triangulations of graphs Algorithmica 39 4 2004 287 298
6. A. Berry, J.-P. Bordat, Triangulated and weakly triangulated graphs: simpliciality in vertices and edges, 6th International Conference on Graph Theory (ICGT 2000), 2000 (Communication).
7. A. Berry, J.-P. Bordat, and P. Heggernes Recognizing weakly triangulated graphs by edge separability Nordic J. Comput. 7 2000 164 177
8. 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
9. A. Berry, A. Sigayret, Obtaining and maintaining polynomial-size concept lattices, in: Proceedings of FCAKDD, (ECAI 2002), 2002, pp. 3-6.
10. A. Berry, A. Sigayret, C. Sinoquet, Maximal sub-triangulation as improving phylogenetic data, Technical Report RR-02-02, LIMOS, Clermont-Ferrand, France, 2002.
11. 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
12. J.R.S. Blair, and B.W. Peyton An introduction to chordal graphs and clique trees J.A. George J.R. Gilbert J.W.H. Liu Graph Theory and Sparse Matrix Computations, IMA Volumes in Mathematics and its Applications vol. 56 1993 Springer Berlin 1 30
13. H.L. Bodlaender, and R.H. Möhring The pathwidth and treewidth of cographs SIAM J. Discrete Math. 6 2 1993 181 188
14. P. Buneman A characterization of rigid circuit graphs Discrete Math. 9 1974 205 212
15. T.F. Coleman A chordal preconditioner for large-scale optimization Appl. Math. 40 1988 265 287
16. E. Dahlhaus Minimal elimination ordering inside a given chordal graph R.H. Möhring Graph Theoretical Concepts in Computer Science-WG '97, Lecture Notes in Computer Science vol. 1335 1997 Springer Berlin 132 143
17. P.M. Dearing, D.R. Shier, and D.D. Warner Maximal chordal subgraphs Discrete Appl. Math. 20 1988 181 190
18. A. Deshpande, M. Garofalakis, M.I. Jordan, Efficient stepwise selection in decomposable models, in: Proceedings of UAI, 2001, pp. 128-135.
19. G.A. Dirac On rigid circuit graphs Abh. Math. Sem. Univ. Hamburg 25 1961 71 76
20. P. Erdös, and R. Laskar On maximum chordal subgraph Congr. Numer. 39 1983 367 373
21. D.R. Fulkerson, and O.A. Gross Incidence matrices and interval graphs Pacific J. Math. 15 1965 835 855
22. F. Gavril The intersection graphs of subtrees in trees are exactly the chordal graphs J. Combin. Theory Ser. B 16 1964 47 56
23. R. Hayward Generating weakly triangulated graphs J. Graph Theory 21 1996 67 70
24. R. Hayward, C. Hoàng, and F. Maffray Optimizing weakly triangulated graphs Graphs Combin. 5 1989 339 349
25. R. Hayward, J. Spinrad, R. Sritharan, Weakly chordal graph algorithms via handles, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000.
26. P. Heggernes, and Y. Villanger Efficient implementation of a minimal triangulation algorithm R.H. Möhring Algorithms-ESA 2002, Lecture Notes in Computer Science vol. 2461 2002 Springer Berlin 550 561
27. 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
28. L. Ibarra, Fully dynamic algorithms for chordal graphs, in: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999.
29. M. Lundquist, Zero patterns chordal graphs and matrix completions, Ph.D. Thesis, Clemson University, USA, 1990.
30. A. Natanzon, R. Shamir, and R. Sharan Complexity classification of some edge modification problems Discrete Appl. Math. 113 2001 109 128
31. 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
32. D.J. Rose, R.E. Tarjan, and G.S. Lueker Algorithmic aspects of vertex elimination on graphs SIAM J. Comput. 5 1976 266 283
33. J. Spinrad, and R. Sritharan Algorithms for weakly triangulated graphs Discrete Appl. Math. 59 1995 181 191
34. J. Walter, Representations of rigid cycle graphs, Ph.D. Thesis, Wayne State University, USA, 1972.
35. J. Xue Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem Networks 24 1994 109 120
36. M. Yannakakis Computing the minimum fill-in is NP-complete SIAM J. Algebraic Discrete Methods 2 1981 77 79