On treewidth approximations

Discrete Applied Mathematics

Volumn 136, Issue 2-3, 2004, Pages 183-196

  Bouchitte V ^a   Kratsch, D ^b   Muller H ^c   Todinca, I ^d  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ DE LORRAINE   (France)

^c UNIVERSITY OF LEEDS   (United Kingdom)

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

Author keywords

Approximation algorithm; Asteroidal number; Graph algorithm; Minimal separator; Treewidth

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; HEURISTIC METHODS; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; TRIANGULATION;

APPROXIMATION ALGORITHMS; ASTEROIDAL NUMBER; GRAPH ALGORITHMS; MINIMAL SEPARATOR; TREEWIDTH;

TREES (MATHEMATICS);

EID: 0346055628     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00440-2     Document Type: Conference Paper

References (16)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows: Theory, Algorithms, and Applications. 1993;Prentice Hall, Englewood Cliffs, NJ.
2. E. Amir, Efficient approximation for triangulation of minimum treewidth, in Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI '01), 2001. http://www.cs.berkeley.edu/̃eyal/papers/decomp-uai01.ps.
3. A. Berry, Désarticulation d'un graphe, Ph.D. Thesis, Université Montpellier II, 1998.
4. Bodlaender H., Gilbert J.R., Hafsteinsson H., Kloks T. Approximating treewidth, pathwidth, frontsize and shortest elimination tree. J. Algorithms. 18:1995;238-255.
5. V. Bouchitté, I. Todinca, Approximating the treewidth of AT-free graphs, in Proceedings of the 26th Workshop on Graph-Theoretic Aspects in Computer Science (WG 2000), Lecture Notes in Computer Sciences, Vol. 1928, Springer, Berlin, 2000, pp. 59-70.
6. Bouchitté V., Todinca I. Treewidth and minimum fill-in. grouping the minimal separators SIAM J. Comput. 31(1):2001;212-232.
7. Bouchitté V., Todinca I. Listing all potential maximal cliques of a graph. Theoret. Comput. Sci. 276(1-2):2002;17-32.
8. Broersma H., Kloks T., Kratsch D., Müller H. A generalization of AT-free graphs and a generic algorithm for solving triangulation problems. Algorithmica. 32:2002;594-610.
9. Even G., Naor J., Rao S., Schieber B. Fast approximate graph partitioning algorithms. SIAM J. Comput. 28(6):1999;2187-2214.
10. H.N. Gabow, Using expander graphs to find vertex connectivity, in 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA. IEEE Computer Society, 2000, pp. 410-420.
11. Kloks T., Kratsch D. Listing all minimal separators of a graph. SIAM J. Comput. 27(3):1998;605-613.
12. Kloks T., Kratsch D., Müller H. Approximating the bandwidth for asteroidal triple-free graphs. J. Algorithms. 32:1999;41-57.
13. Kloks T., Kratsch D., Müller H. On the structure of graphs with bounded asteroidal number. Graphs Combin. 17:2001;295-306.
14. Leighton T., Rao S. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM. 46(6):1999;787-832.
15. Parra A., Scheffler P. Characterizations and algorithmic applications of chordal graph embeddings. Discrete Appl. Math. 79(1-3):1997;171-188.
16. Tarjan R.E. Decomposition by clique separators. Discrete Math. 55:1985;221-232.