Parameterized complexity: Exponential speed-up for planar graph problems

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

Volumn 2076 LNCS, Issue , 2001, Pages 261-272

  Alber, Jochen ^a   Fernau, Henning ^a   Niedermeier, Rolf ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; GRAPH THEORY; GRAPHIC METHODS; ALGORITHMS; COMPUTATIONAL LINGUISTICS;

ARBITRARY FUNCTIONS; INDEPENDENT SET; PARAMETERIZED COMPLEXITY; PARAMETERIZED PROBLEMS; PLANAR DOMINATING SET; PLANAR VERTEX COVER; SEPARATION PROPERTY; SOLVING ALGORITHM;

EXPONENTIAL FUNCTIONS;

EID: 84879521200     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_22     Document Type: Conference Paper

References (17)

1. J. Alber, H. Bodlaender, H. Fernau, and R. Niedermeier. Fixed parameter algorithms for planar dominating set and related problems. In Proc. 7th SWAT, vol. 1851 of LNCS, Springer, pp. 97-110, 2000. Full version available as Technical Report UU-CS-2000-28, Utrecht University, 2000.
2. J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speed-up for planar graph problems. Technical Report TR01-023, ECCC Reports, Trier, March 2001. Available through http://www. eccc. uni-trier. de/eccc/.
3. J. Alber, H. Fernau, and R. Niedermeier. Graph separators: a parameterized view. To appear in Proc. 7th COCOON, 2001. Full version available as Technical Report WSI-2001-8, Universiẗat Tübingen (Germany), Wilhelm-Schickard-Institut für Informatik, March 2001.
4. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41(1):153-180, 1994.
5. H. L. Bodlaender. Treewidth: Algorithmic techniques and results. In Proc. 22nd MFCS, vol. 1295 of LNCS, Springer, pp. 19-36, 1997.
6. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theor. Comp. Sci. , 209:1-45, 1998.
7. L. Cai and D. Juedes. Subexponential parameterized algorithms collapse the W-hierarchy. In Proc. 28th ICALP, 2001.
8. J. Chen, I. Kanj, and W. Jia. Vertex cover: Further observations and further improvements. In Proc. 25th WG, vol. 1665 of LNCS, Springer, pp. 313-324, 1999.
9. H. N. Djidjev and S. Venkatesan. Reduced constants for simple cycle graph separation. Acta Informatica, 34:231-243, 1997.
10. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
11. T. Kloks. Treewidth: Computations and Approximations, vol. 842 of LNCS, Springer, 1994.
12. R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. SIAM J. Comp. , 9(3):615-627, 1980.
13. K. Mehlhorn and S. N̈aher. LEDA: A Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, England, 1999.
14. R. Niedermeier and P. Rossmanith. Upper Bounds for Vertex Cover further improved. In Proc. 16th STACS, vol. 1563 of LNCS, Springer, pp. 561-570, 1999.
15. G. L. Nemhauser and J. L. E. Trotter. Vertex packing: structural properties and algorithms. Math. Progr. , 8:232-248, 1975.
16. N. Robertson, D. P. Sanders, P. Seymour, and R. Thomas. Efficiently four-coloring planar graphs. In Proc. 28th STOC, ACM Press, pp. 571-575, 1996.
17. J. A. Telle and A. Proskurowski. Practical algorithms on partial k-trees with an application to domination-like problems. In Proc. 3rd WADS, vol. 709 of LNCS, Springer, pp. 610-621, 1993.