Two birds with one stone: The best of branchwidth and treewidth with one algorithm

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

Volumn 3887 LNCS, Issue , 2006, Pages 386-397

  Dorn, Frederic ^a   Telle, Jan Arne ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

BRANCH-DECOMPOSITIONS; DYNAMIC PROGRAMMING ALGORITHM; OPTIMIZATION PROBLEMS; TREE-DECOMPOSITION;

TREES (MATHEMATICS);

EID: 33745617872     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682462_37     Document Type: Conference Paper

References (17)

1. J. ALBER, Exact algorithms for np-hard problems on networks: Design, analysis, and implementation, PhD Thesis, Universitãt Tübingen, (2002).
2. J. ALBER, H. BODLAENDER, H. FERNAU, T. KLOKS, AND R. NIEDERMEIER, Fixed parameter algorithms for Dominating Set and related problems on planar graphs, Algorithmica, 33 (2002), pp. 461-493.
3. J. ALBER AND R. NIEDERMEIER, Improved tree decomposition based algorithms for domination-like problems, in LATIN'02: Theoretical informatics (Cancun), vol. 2286 of Lecture Notes in Computer Science, Berlin, 2002, Springer, pp. 613-627.
4. S. ARNBORG AND A. PROSKUROWSKI, Linear time algorithms for np-hard problems restricted to partial k-trees, Discrete Applied Math, 23 (1989), pp. 11-24.
5. H. BODLAENDER, Treewidth: Algorithmic techniques and resulte., in MFCS'97; Mathematical Foundations of Computer Science 1997, 22nd International Symposium (MFCS), vol. 1295 of Lecture Notes in Computer Science, Springer, 1997, pp. 19-36.
6. W. COOK AND P. SEYMOUR, Tour merging via branch-decomposition, INFORMS Journal on Computing, 15 (2003), pp. 233-248.
7. E. D. DEMAINE, F. V. FOMIN, M. T. HAJIAGHAYI, AND D. M. THILIKOS, Fixed-parameter algorithms for the (k,r)-center in planar graphs and map graphs, in ICALP'03: Automata, languages and programming, vol. 2719 of Lecture Notes in Comput. Sci., Berlin, 2003, Springer, pp. 829-844.
8. F. DORN, E. PENNINKX, H. L. BODLAENDER, AND F. V. FOMIN, Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions, in ESA'05: 13th Annual European Symposium on Algorithms, vol. 3669 of Lecture Notes in Comput. Sci., Berlin, 2005, Springer, pp. 95-106.
9. F. DORN AND J. TELLE, Two birds with one stone: the best of branchwidth and treewidth with one algorithm, long version, (2005). http://www.ii.uib.no/ ~frederie/DT.pdf.
10. F. V. FOMIN AND D. M. THILIKOS, Dominating sets in planar graphs: branchwidth and exponential speed-up, in SODA'03: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003), New York, 2003. ACM, pp. 168-177.
11. _, Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up, in ICALP'04:Automata, Languages and Programming: 31st International Colloquium, vol. 3142 of Lecture Notes in Computer Science, Berlin, 2004. Springer, pp. 581-592.
12. _, A simple and fast approach for solving problems on planar graphs., in STACS'04: 22nd Ann. Symp. on Theoretical Aspect of Computer Science, vol. 2996 of Lecture Notes in Computer Science, Berlin, 2004, Springer, pp. 56-67.
13. J. KLEINBERG AND E. TARDOS, Algorithm design, Addison-Wesley, 2005.
14. T. KLOKS, Treewidth, vol. 842 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1994. Computations and approximations.
15. B. REED, Treewidth and tangles, a new measure of connectivity and some applications, Surveys in Combinatorics, 1997.
16. N. ROBERTSON AND P. SEYMOUR, Graph minors X. Obstructions to tree-decomposition., Journal of Combinatorial Theory Series B, 52 (1991), pp. 153-190.
17. J. A. TELLE AND A. PROSKUROWSKI, Algorithms for vertex partitioning problems on partial k-trees, SIAM J. Discrete Math, 10 (1997), pp. 529-550.