Exact (exponential) algorithms for treewidth and minimum fill-in

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

Volumn 3142, Issue , 2004, Pages 568-580

  Fomin, Fedor V ^a   Kratsch, Dieter ^b   Todinca, Ioan ^c  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITÉ DE LORRAINE   (France)

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

COMBINATORIAL PROOF; GRAPH G; MAXIMAL CLIQUE; TREE-WIDTH;

GRAPH THEORY;

EID: 35048864458     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_49     Document Type: Article

References (25)

1. E. AMIR, Efficient approximation for triangulation of minimum treewidth, in Uncertainty in Artificial Intelligence: Proceedings of the Seventeenth Conference (UAI-2001), San Francisco, CA, 2001, Morgan Kaufmann Publishers, pp. 7-15.
2. S. ARNBORG, D. G. CORNEIL, AND A. PROSKUROWSKI, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, 8 (1987), pp. 277-284.
3. A. BERRY, J.P. BORDAT, AND O. COGIS, Generating all the minimal separators of a graph, In Workshop on Graph-theoretic Concepts in Computer Science (WG'99), vol. 1665 of Lecture Notes in Computer Science. Springer-Verlag, 1999.
4. H. L. BODLAENDER, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput., 25 (1996), pp. 1305-1317.
5. _, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci., 209 (1998), pp. 1-45.
6. H. L. BODLAENDER AND F. V. FOMIN, Tree decompositions with small cost, Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT 2002), volume 2368 of Lecture Notes in Computer Science, pp. 378-387, Springer-Verlag, 2002.
7. V. BOUCHITTÉ AND I. TODINCA, Treewidth and minimum fill-in: grouping the minimal separators, SIAM J. on Computing, 31(1):212-232, 2001.
8. V. BOUCHITTÉ AND I. TODINCA, Listing all potential maximal cliques of a graph, Theoretical Computer Science, 276(1-2):17-32, 2002.
9. V. BOUCHITTÉ, D. KRATSCH, H. MÜLLER, AND I. TODINCA, On treewidth approximation, Discr. Appl. Math., to appear.
10. L. CAI, Fixed-parameter tractability of graph modification problems for hereditary properties, Inform. Process. Lett., 58 (1996), pp. 171-176.
11. W. COOK AND P. SEYMOUR, Tour merging via branch-decomposition, INFORMS J. on Computing, 15 (3)(2003), pp. 233-248.
12. n algorithm for k-SAT based on local search, Theoret. Comput. Sci., 289 (2002), pp. 69-83.
13. R. G. DOWNEY AND M. R. FELLOWS, Parameterized Complexity, Springer-Verlag, New York, 1999.
14. D. EPPSTEIN, Small maximal independent sets and faster exact graph coloring, in Algorithms and data structures (Providence, RI, 2001), vol. 2125 of Lecture Notes in Comput. Sci., Springer, Berlin, 2001, pp. 462-470.
15. U. FEIGE, Coping with the NP-hardness of the graph bandwidth problem, in Algorithm theory - SWAT 2000 (Bergen), vol. 1851 of Lecture Notes in Comput. Sci., Springer, Berlin, 2000, pp. 10-19.
16. F. FOMIN, D. KRATSCH AND I. TODINCA, Exact (exponential) algorithms for treewidth and minimum fill-in, Research Report RR-2004-09, LIFO-University of Orléans, 2004.
17. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
18. M. HELD AND R. KARP, A dynamic programming approach to sequencing problems, J. Soc. Indust. Appl. Math., 10 (1962), pp. 196-210.
19. H. KAPLAN, R. SHAMIR, AND R. E. TARJAN, Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs, SIAM J. Comput., 28 (1999), pp. 1906-1922.
20. T. KLOKS, D. KRATSCH, AND J. SPINRAD, On treewidth and minimum fill-in of asteroidal triple-free graphs, Theoretical Computer Science, 175:309-335, 1997.
21. A. PARRA AND P. SCHEFFLER, Characterizations and algorithmic applications of chordal graph embeddings, Discrete Appl. Math., 79(1-3):171-188, 1997.
22. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, 7 (1986), pp. 309-322.
23. _, Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B, 52 (1991), pp. 153-190.
24. G. J. WOEGINGER, Exact algorithms for NP-hard problems: a survey, in Combinatorial Optimization: "Eureka, you shrink", M. J. et al., ed., Springer, vol. 2570, Berlin, 2003, pp. 185-207.
25. M. YANNAKAKIS, Computing the minimum fill-in is NP-complete, SIAM J. Algebraic Discrete Methods, 2 (1981), pp. 77-79.