Moplex elimination orderings

Electronic Notes in Discrete Mathematics

Volumn 8, Issue , 2001, Pages 6-9

  Berry, Anne ^a   Bordat, Jean Paul ^b  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34247171858     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(05)80065-4     Document Type: Article

References (9)

1. A. Berry., A wide-range efficient algorithm for minimal triangulation. In Proceedings of SODA'99.
2. Berry A., and Bordat J.-P. Separability generalizes Dirac's theorem. Discrete Applied Mathematics 84 (1998) 43-53
3. A. Berry, J.-P. Bordat., Triangulated and Weakly triangulated graphs: simpliciality in vertices and edges. International Conference on Graph Theory, Marseille (2000), submitted to D.A.M.
4. Blair J.R.S., and Peyton B.W. An introduction to chordal graphs and clique trees. Graph Theory and Sparse Matrix Computations. In: George J.A., Gilbert J.R., and Liu J.W.H. (Eds). IMA Volumes in Mathematics and its Applications 56 (1993), Springer Verlag 1-30
5. Dalhaus E. Minimal elimination ordering inside a given chordal graph. In: Möhring R.H. (Ed). Graph Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, 1335 (1997), Springer, Berlin 132-143
6. Fulkerson D.R., and Gross O.A. Incidence matrixes and interval graphs. Pacific Journal of Math. 15 (1965) 835-855
7. T. Kloks, D. Kratsch, and H. Müller., Approximating the bandwidth for asteroidal triple-free graphs. Proceedings of ESA '95.
8. Parra A. Structural and algorithmics aspects of chordal graphs embeddings. Ph.D. Thesis (1996), Technische Universitt, Berlin
9. Rose D., Tarjan R.E., and Lueker G. Algorithmic aspects of vertex elimination on graphs. SIAM Journ. Comput. 5 (1976) 146-160