A generalization of AT-free graphs and a generic algorithm for solving treewidth, minimum Fill-in and vertex ranking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1517, Issue , 1998, Pages 88-99

  Broersma, Hajo ^a   Kloks, Ton ^a   Kratsch, Dieter ^b   Müller, Haiko ^b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

ASTEROIDAL TRIPLES; CARDINALITIES; GENERIC ALGORITHM; GRAPH PARAMETERS; INPUT GRAPHS; RUNNING TIME; TRIANGULATION PROBLEM; VERTEX-RANKING;

GRAPH THEORY;

EID: 84947917295     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10692760_8     Document Type: Conference Paper

References (30)

1. Arnborg, S., Efficient algorithms for combinatorial problems on graphs with bounded decomposability-A survey. BIT 25 (1985), pp.2-23.
2. Arnborg, S., D. G. Corneil and A. Proskurowski, Complexity of finding embeddings in a fc-tree, SIAM J. Alg. Disc. Meth. 8 (1987), pp. 277-284.
3. 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, 1993, LNCS 657, pp. 90-102.
4. Bodlaender, H., A tourist guide through treewidth, Acta Cybernetica 11 (1993), pp. 1-23.
5. Bodlaender, H., A linear time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on Computing 25 (1996), pp. 1305-1317.
6. Bodlaender, H., J.S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Muller, Zs. Tuza, Rankings of graphs, SIAM Journal on Discrete Mathematics 11 (1998), pp. 168-181
7. Bodlaender, H. L., J. R. Gilbert, H. Hafsteinsson, T. Kloks, Approximating tree-width, pathwidth and minimum elimination tree height, Journal ofAlgorithms 18 (1995), pp. 238-255.
8. Bodlaender, H., T. Kloks and D. Kratsch, Treewidth and pathwidth ofpermutation graphs, SIAM Journal on Discrete Mathematics 8 (1995), pp. 606-616.
9. Cormen, T. H., C. E. Leiserson and R. L. Rivest, Introduction to algorithms, MlT Press, Cambridge, Massachusetts, USA, 1990.
10. Corneil, D. G., S. Olariu and L. Stewart, Asteroidal triple-free graphs, SIAM Journal on Discrete Mathematics. 10 (1997), pp. 399-430.
11. Corneil, D. G., S. Olariu and L. Stewart, A linear time algorithm to compute dominating pairs in asteroidal triple-free graphs, Proceedings of ICALP'95, Springer-Verlag, LNCS 944, 1995, pp. 292-302.
12. Deogun, J. S., T. Kloks, D. Kratsch and H. Muller, On vertex ranking for permutation and other graphs, 11th Annual Symposium on Theoretical Aspects of Computer Science, Springer-Verlag, LNCS 775, 1994, pp. 747-758.
13. Dirac, G. A., On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961), pp. 71-76.
14. Golumbic, M. C., Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
15. Habib, M. and R. H. Mohring, Treewidth of cocomparability graphs and a new order-theoretic parameter, Order 11 (1994), pp. 47-60.
16. Kloks, T., Treewidth - Computations and Approximations, Springer Verlag, LNCS 842, (1994).
17. Kloks, T. and D. Kratsch, Finding all minimal separators of a graph, SIAM Journal on Computing 27 (1998), pp. 605-613.
18. Kloks, T., D. Kratsch and H. Muller, Asteroidal sets in graphs, Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'97), Springer-Verlag, LNCS 1335 (1997), pp. 229-241.
19. Kloks, T., D. Kratsch and J. Spinrad, On treewidth and minimum fill-in of aster-oidal triple-free graphs, Theoretical Computer Science 175 (1997), pp. 309-335.
20. Kloks, T., H. Muller and C. K. Wong, Vertex ranking of asteroidal triple-free graphs, Proceedings of the 7th International Symposium on Algorithms and Computation, pp. 174-182, Springer Verlag, LNCS 1178, 1996.
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. Lekkerkerker, C. G. and J. Ch. Boland, Representation of a finite graph by a set of intervals on the real line, Fundamenta Mathematicae 51 (1962), pp. 45-64.
23. Lin, I. J., T. A. McKee and D. B. West, Leafage of chordal graphs, Manuscript 1994.
24. Liu, J. W. H., The role of elimination trees in sparse factorization, SIAM Journal of Matrix Analysis and Applications 11 (1990), pp. 134-172.
25. Mohring, R. H., Triangulating graphs without asteroidal triples, Discrete Applied Mathematics 64 (1996), pp. 281-287.
26. Parra, A., Structural and algorithmic aspects of chordal graph embeddings, PhD. thesis, Technische Universitat Berlin, 1996.
27. Prisner, E., Representing triangulated graphs in stars, Abh. Math. Sem. Univ. Hamburg 62 (1992), pp. 29-41.
28. Rose, D. J., R. E. Tarjan and G. S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM Journal on Computing 5 (1976), pp. 266-283.
29. Walter, J. R., Representations of chordal graphs as subtrees of a tree, Journal of Graph Theory 2 (1978), pp. 265-267.
30. Yannakakis, M., Computing the minimum fill-in is NP-complete, SIAM Journal on Algebraic and Discrete Methods 2 (1981), pp. 77-79.