Computing branchwidth via efficient triangulations and blocks

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

Volumn 3787 LNCS, Issue , 2005, Pages 374-384

  Fomin, Fedor ^a   Mazoit, Frédéric ^b   Todinca, Ioan ^c  

^a UNIVERSITY OF BERGEN   (Norway)

^b AIX MARSEILLE UNIV   (France)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES; GRAPH THEORY; POLYNOMIALS; TREES (MATHEMATICS);

BRANCHWIDTH; MAXIMAL CLIQUES; TREEWIDTH; TRIANGULATIONS;

COMPUTATION THEORY;

EID: 33744936848     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604686_33     Document Type: Conference Paper

References (25)

1. n): a no-MIS algorithm. Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (FOCS 1995), pp. 444-452.
2. n). Journal of Algorithms, 54:444-453, 2005.
3. H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci., 209:1-45, 1998.
4. H.L. Bodlaender, T. Kloks, and D. Kratsch. Treewidth and pathwidth of permutation graphs. SIAM J. on Discrete Math., 8:606-616, 1995.
5. V. Bouchitté and I. Todinca. Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. on Computing, 31(1):212-232, 2001.
6. J. M. Byskov. Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters, 32:547-556, 2004.
7. T. Cormen, C. Leiserson, and R. Rivest. Introduction to algorithms. The MIT press, 1990.
8. n algorithm for k-SAT based on local search. Theoretical Computer Science, 289(1):69-83, 2002.
9. D. Eppstein. Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 329-337.
10. F. Fomin, D. Kratsch, and I. Todinca. Exact (exponential) algorithms for treewidth and minimum fill-in. In Proceedings 31st International Colloquium on Automatas, Languages and Programming (ICALP'04), volume 3142 of Lecture Notes in Computer Science, pages 568-580. Springer, 2004.
11. F. Gavril. The intersection graphs of a path in a tree are exactly the chordal graphs. Journal of Combinatorial Theory, 16:47-56, 1974.
12. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
13. K. Iwama and S. Tamaki. Improved upper bounds for 3-SAT. Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), p.328.
14. 0.304n) algorithm for solving maximum independent set problem. IEEE Transactions on Computers, 35(9):847-851, 1986.
15. T. Kloks, J. Kratochvfl, and H. Müller. New branchwidth territories. In Proceedings 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS '99), volume 1563 of Lecture Notes in Computer Science, pages 173-183. Springer, 1999.
16. F. Mazoit. Décompositions algorithmiques des graphes. PhD thesis, École normale supérieure de Lyon, 2004. In French.
17. A. Parra and P. Scheffler. Characterizations and algorithmic applications of chordal graph embeddings. Discrete Appl. Math., 79(1-3):171-188, 1997.
18. R. Paturi, P. Pudlak, M. E. Saks, and F. Zane. An improved exponential-time algorithm for k-SAT. Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (FOCS 1998), pp. 628-637.
19. N. Robertson and P. Seymour. Graph minors X. Obstructions to tree decompositions. Journal of Combinatorial Theory Series B, 52:153-190, 1991.
20. J. M. Robson. Algorithms for maximum independent sets. Journal of Algorithms, 7(3):425-440, 1986.
21. U. Schoning. A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS 1999), pp. 410-414.
22. P. D. Seymour and R. Thomas, Call routing and the ratcatcher, Combinatorica, 14:217-241, 1994.
23. R. Tarjan and A. Trojanowski. Finding a maximum independent set. SIAM Journal on Computing, 6(3):537-546, 1977.
24. R. Williams. A new algorithm for optimal constraint satisfaction and its implications. Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), Springer LNCS vol. 3142, 2004, pp. 1227-1237.
25. G. J. Woeginger. Exact algorithms for NP-hard problems: A survey. Combinatorial Optimization - Eureka, You Shrink, Springer LNCS vol. 2570, 2003, pp. 185-207.