Lex M versus MCS-M

Discrete Mathematics

Volumn 306, Issue 3, 2006, Pages 393-400

  Villanger, Yngve ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Chordal graph; Elimination ordering; Lex M; MCS M; Minimal triangulation

Indexed keywords

PROBLEM SOLVING; TRIANGULATION;

CHORDAL GRAPH; ELIMINATION ORDERING; LEX M; MCS-M; MINIMAL TRIANGULATION;

GRAPH THEORY;

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

References (13)

1. 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
2. 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
3. A. Berry, J.R.S. Blair, P. Heggernes, and B.W. Peyton Maximum cardinality search for computing minimal triangulations of graphs Algorithmica 39 2004 287 298
4. A. Berry, J. Bordat, P. Heggernes, G. Simonet, Y. Villanger, A wide-range algorithm for minimal triangulation from an arbitrary ordering, J. Algorithms 58 (1) (2006) 33-66.
5. A. Berry, P. Heggernes, Y. Villanger, A vertex incremental approach for dynamically maintaining chordal graphs, in: Proceedings of the 14th International Symposium on Algorithms and Computation-ISAAC 2003, Lecture Notes in Computer Science, vol. 2906, Springer, Berlin, 2003, pp. 47 - 57.
6. 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
7. E. Dahlhaus, Minimal elimination ordering inside a given chordal graph, in: R.H. Möhring (Ed.), Graph Theoretical Concepts in Computer Science-WG '97, Lecture Notes in Computer Science, vol. 1335, Springer, Berlin, 1997, pp. 132-143.
8. D.R. Fulkerson, and O.A. Gross Incidence matrices and interval graphs Pacific J. Math. 15 1965 835 855
9. T. Ohtsuki A fast algorithm for finding an optimal ordering in the vertex elimination on a graph SIAM J. Comput. 5 1976 133 145
10. S. Parter The use of linear graphs in Gauss elimination SIAM Rev. 3 1961 119 130
11. B.W. Peyton Minimal orderings revisited SIAM J. Matrix Anal. Appl. 23 1 2001 271 294
12. D. Rose, R.E. Tarjan, and G. Lueker Algorithmic aspects of vertex elimination on graphs SIAM J. Comput. 5 1976 146 160
13. M. Yannakakis Computing the minimum fill-in is NP-complete SIAM J. Algebraic Discrete Methods 2 1981 77 79