Approximating the treewidth of AT-free graphs

Discrete Applied Mathematics

Volumn 131, Issue 1, 2003, Pages 11-37

  Bouchitté, Vincent ^a   Todinca, Ioan ^b  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

AT free graphs; Graph algorithms; Treewidth

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

TREEWIDTH;

GRAPH THEORY;

EID: 0041360445     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00414-6     Document Type: Conference Paper

References (14)

1. Arnborg S., Corneil D.G., Proskurowski A. Complexity of finding embeddings in a. k -tree SIAM J. Algebraic Discrete Methods. 8:1987;277-284.
2. Bodlaender H., Gilbert J.R., Hafsteinsson H., Kloks T. Approximating treewidth, pathwidth, frontsize and shortest elimination tree. J. Algorithms. 18:1995;238-255.
3. Bodlaender H.L., Kloks T., Kratsch D. Treewidth and pathwidth of permutation graphs. SIAM J. Discrete Math. 8:1995;606-616.
4. V. Bouchitté, I. Todinca, Minimal triangulations for graphs with "few" minimal separators, in: Proceedings of the Sixth Annual European Symposium on Algorithms (ESA' 98), Lecture Notes in Computer Science, Vol. 1461, Springer, Berlin, 1998, pp. 344-355.
5. V. Bouchitté, I. Todinca, Listing all potential maximal cliques of a graph, in: Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000), Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, 2000, pp. 503-515.
6. Bouchitté V., Todinca I. Treewidth and minimum fill-in. grouping the minimal separators SIAM J. Comput. 31(1):2001;212-232.
7. H. Broersma, T. Kloks, D. Kratsch, H. Müller, A generalization of AT-free graphs and a generic algorithm for solving triangulation problems, in: Workshop on Graph-theoretic Concepts in Computer Science WG'98, Lecture Notes in Computer Science, Vol. 1517, Springer, Berlin, 1998, pp. 88-99.
8. Even S., Tarjan R.E. Network flow and testing graph connectivity. SIAM J. Comput. 4:1975;507-518.
9. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
10. Kloks T., Kratsch D., Müller H. Approximating the bandwidth for asteroidal triple-free graphs. J. Algorithm. 32:1999;41-57.
11. Kloks T., Kratsch D., Spinrad J. On treewidth and minimum fill-in of asteroidal triple-free graphs. Theoret. Comput. Sci. 175:1997;309-335.
12. A. Parra, Structural and algorithms aspects of chordal graph embeddings, Ph.D. Thesis, Technische Universität, Berlin, 1998.
13. Parra A., Scheffler P. Characterizations and algorithmic applications of chordal graph embeddings. Discrete Appl. Math. 79(1-3):1997;171-188.
14. Robertson N., Seymour P. Graphs minors, II. Algorithmic aspects of tree-width. J. Algorithms. 7:1986;309-322.