Algorithms based on the treewidth of sparse graphs

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

Volumn 3787 LNCS, Issue , 2005, Pages 385-396

  Kneis, Joachim ^a   Mölle, Daniel ^a   Richter, Stefan ^a   Rossmanith, Peter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MAX-CUT; PATHWIDTH; POLYNOMIAL SPACE; TREEWIDTH;

GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

ALGORITHMS;

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

References (11)

1. H. L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11:1-21, 1993.
2. A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph Classes: A Survey. SIAM monographs on discrete mathematics and applications. SIAM, 1999.
3. J. Chen and I. A. Kanj. Improved exact algorithms for Max-Sat. Discrete Applied Mathematics, 142(1-3):17-27, 2004.
4. F. V. Fomin and K. Høle. Pathwidth of cubic graphs and exact algorithms. Technical Report 298, Department of Informatics, University of Bergen, May 2005.
5. F. V. Fomin, D. Kratsch, and G. J. Woeginger. Exact (exponential) algorithms for the dominating set problem. In Proc. of 30th WG, number 3353 in LNCS, pages 245-256. Springer, 2004.
6. J. Gramm, E. A. Hirsch, R. Niedermeier, and P. Rossmanith. New worst-case upper bounds for MAX-2-SAT with application to MAX-CUT. Discrete Applied Mathematics, 130(2):139-155, 2003.
7. B. A. Madsen and P. Rossmanith. Maximum exact satisfiability: NP-completeness proofs and exact algorithms. Technical Report RS-04-19, BRICS, Oct. 2004.
8. A. Scott and G. B. Sorkin. Faster algorithms for Max-CUT and Max-CSP, with polynomial expected time for sparse instances. In Proc. of 7th RANDOM, number 2764 in LNCS, pages 382-395. Springer, 2003.
9. J. A. Telle and A. Proskurowski. Algorithms for vertex partitioning problems on partial k-trees. SIAM Journal on Discrete Mathematics, 10(4):529-550, 1997.
10. R. Williams. A new algorithm for optimal constraint satisfaction and its implications. In Proc. of 31st ICALP, number 3142 in LNCS, pages 1227-1237. Springer, 2004.
11. G. Woeginger. Exact algorithms for NP-hard problems: A survey. In M. Junger, G. Reinelt, and G. Rinaldi, editors, Combinatorial Optimization - Eureka, You Shrink!, number 2570 in LNCS, pages 185-207. Springer, 2003.