Branching and treewidth based exact algorithms

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

Volumn 4288 LNCS, Issue , 2006, Pages 16-25

  Fomin, Fedor V ^a   Gaspers, Serge ^a   Saurabh, Saket ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED TREEWIDTH; EXACT ALGORITHMS; EXPONENTIAL TIME; MAXIMUM WEIGHTED INDEPENDENT SET; MINIMUM MAXIMAL MATCHING; NP-HARD PROBLEM; PARAMETERIZED ALGORITHM; SIMPLE ALGORITHM; TECHNIQUES USED; TREE-WIDTH; VERTEX COVER PROBLEMS;

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY;

COMPUTATIONAL EFFICIENCY;

EID: 77249133684     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11940128_4     Document Type: Conference Paper

References (14)

1. H. L. BoDLAENDER, A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, 209 (1998), pp. 1-45.
2. V. DAHLLÖF AND P. JONSSON, An algorithm for counting maximum weighted independent sets and its applications, in 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), ACM and SIAM, 2002, pp. 292-298.
3. V. DAHLLÖF, P. JONSSON, AND M. WAHUSTRÖM, Counting models for 2SAT and 3SAT formulae, Theoretical Computer Science, 332 (2005), pp. 265-291.
4. F. V. FOMIN, F. GRANDONI, AND D. KRATSCH, Some new techniques in design and analysis of exact (exponential) algorithms, Bulletin of the EATCS, 87 (2005), pp. 47-77.
5. F. V. FOMIN AND K. HøIE, Pathwidth of cubic graphs and exact algorithms, Information Processing Letters, 97 (2006), pp. 191-196.
6. M. FüRER AND S. P. KASIVISWANATHAN, Algorithms for counting 2-SAT solutions and colorings with applications, Electronic Colloquium on Computational Complexity (ECCC), vol.33, 2005.
7. M. K. GOLDBERG, D. BERQUE, AND T. SPENCER A Low-Exponential Algorithm for Counting Vertex Covers, Graph Theory, Combinatorics, Algorithms, and Applications, vol.1, (1995), pp.431-444.
8. D. S. JOHNSON, M. YANNAKAKIS, AND C. H. PAPADIMITRIOU, On generating all maximal independent sets, Information Processing Letters, 27 (1988), pp. 119-123.
9. J. KNEIS, D. MÖLLE, S. RICHTER, AND P. ROSSMANITH, Algorithms based in treewidth of sparse graphs, in Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), vol.3787 of LNCS, Springer, (2005), pp. 385-396.
10. J. W. MOON AND L. MOSER, On cliques in graphs, Israel Journal of Mathematics, 3 (1965), pp. 23-28.
11. R. NIEDERMEIER AND P. ROSSMANITH, On efficient fixed-parameter algorithms for weighted vertex cover, Journal of Algorithms, 47 (2003), pp. 63-77.
12. V. RAMAN, S. SAURABH, AND S. SIKDAR, Efficient exact algorithms through enumerating maximal independent sets and other techniques, Theory of Computing Systems, to appear.
13. B. RANDERATH AND I. SCHIERMEYER, Exact algorithms for MINIMUM DOMINATING SET, Technical Report zaik-469, Zentrum für Angewandte Informatik Köln, Germany, 2004.
14. G. WoEGINGER, Exact algorithms for NP-hard problems: A survey, in Combinatorial Optimization - Eureka, you shrink!, vol.2570 of LNCS, Springer, (2003), pp. 185-207.