A generalization of AT-free graphs and a generic algorithm for solving triangulation problems

Algorithmica (New York)

Volumn 32, Issue 4, 2002, Pages 594-610

  Broersma, H J ^a   Kloks, T ^d   Kratsch, D ^b   Muller H ^c  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITÉ DE LORRAINE   (France)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^d NONE

Author keywords

Algorithm; Asteroidal triple; Complexity; Graph; Minimum fill in; Treewidth; Vertex ranking

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING; SET THEORY;

TRIANGULATION PROBLEMS;

ALGORITHMS;

EID: 0141888235     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0091-x     Document Type: Article

References (28)

1. Arnborg, S., Efficient algorithms for combinatorial problems on graphs with bounded decomposability-a survey. BIT 25 (1985), 2-23.
2. Arnborg, S., D. G. Corneil and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM Journal on Algebraic and Discrete Methods 8 (1987), 277-284.
3. Berry, A., J.-P. Bordat and O. Cogis, Generating all the minimal separators of a graph, Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '99, Springer-Verlag, Berlin, LNCS 1665, 1999, pp. 167-172.
4. Bodlaender, H., Kayles on special classes of graphs-An application of Sprague-Grundy theory. Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '92, Springer-Verlag, Berlin, LNCS 657, 1993, pp. 90-102.
5. Bodlaender, H., A tourist guide through treewidth, Acta Cybemetica 11 (1993), 1-23.
6. Bodlaender, H., A linear time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on Computing 25 (1996), 1305-1317.
7. Bodlaender, H., J. S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Müller and Zs. Tuza, Rankings of graphs, SIAM Journal on Discrete Mathematics 11 (1998), 168-181.
8. Bodlaender, H. L., J. R. Gilbert, H. Hafsteinsson and T. Kloks, Approximating treewidth, pathwidth and minimum elimination tree height, Journal of Algorithms 18 (1995), 238-255.
9. Bodlaender, H., T. Kloks and D. Kratsch, Treewidth and pathwidth of permutation graphs, SIAM Journal on Discrete Mathematics 8 (1995), 606-616.
10. Broersma, H. J., T. Kloks, D. Kratsch and H. Müller, Independent sets in asteroidal triple-free graphs, SIAM Journal on Discrete Mathematics 12 (1999), 276-287.
11. Comeil, D. G., S. Olariu and L. Stewart, A linear time algorithm to compute a dominating path in an AT-free graph, Information Processing Letters 54 (1995), 253-257.
12. Cornell, D. G., S. Olariu and L. Stewart, Asteroidal triple-free graphs, SIAM Journal on Discrete Mathematics 10 (1997), 399-430.
13. Deogun, J. S., T. Kloks, D. Kratsch and H. Müller, On the vertex ranking problem for trapezoid, circular-arc and other graphs, Discrete Applied Mathematics 98 (1999), 39-63.
14. Dirac, G. A., On rigid circuit graphs, Abhandlungen des Mathematischen Sememinars der Universität Hamburg 25 (1961), 71-76.
15. Golumbic, M. C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
16. Kloks, T., Treewidth - Computations and Approximations, Springer-Verlag, Berlin, LNCS 842, 1994.
17. Kloks, T., and D. Kratsch, Listing all minimal separators of a graph, SIAM Journal on Computing 27 (1998), 605-613.
18. Kloks, T., D. Kratsch and H. Müller, Asteroidal sets in graphs, Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '97, Springer-Verlag, Berlin, LNCS 1335, 1997, pp. 229-241.
19. Kloks, T., D. Kratsch and J. Spinrad, On treewidth and minimum fill-in of asteroidal triple-free graphs, Theoretical Computer Science 175 (1997), 309-335.
20. Kloks, T., H. Müller and C. K. Wong, Vertex ranking of asteroidal triple-free graphs, Information Processing Letters 68 (1998), 201-206.
21. Leiserson, C. E., Area efficient graph layouts for VLSI, Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, 1980, pp. 270-281.
22. Lin, I. J., T. A. McKee and D. B. West, Leafage of chordal graphs, Discussiones Mathematicae Graph Theory 18 (1998), 23-18.
23. Liu, J. W. H., The role of elimination trees in sparse factorization, SIAM Journal of Matrix Analysis and Applications 11 (1990), 134-172.
24. Möhring, R. H., Triangulating graphs without asteroidal triples, Discrete Applied Mathematics 64 (1996), 281-287.
25. Prisner, E., Representing triangulated graphs in stars, Abhandlungen des Mathematischen Seminars der Universität Hamburg 62 (1992), 29-41.
26. Rose, D. J., R. E. Tarjan and G. S. Luecker, Algorithmic aspects of vertex elimination on graphs, SIAM Journal on Computing 5 (1976), 266-283.
27. Walter, J. R., Representations of chordal graphs as subtrees of a tree, Journal of Graph Theory 2 (1978), 265-267.
28. Yannakakis, M., Computing the minimum fill-in is NP-complete, SIAM Journal on Algebraic and Discrete Methods 2 (1981), 77-79.