Journal
SIAM JOURNAL ON COMPUTING
Volume 36, Issue 2, Pages 281-309Publisher
SIAM PUBLICATIONS
DOI: 10.1137/S0097539702419649
Keywords
branch-width; tree-width; dominating set; planar graph; fixed-parameter algorithm
Ask authors/readers for more resources
We introduce a new approach to design parameterized algorithms on planar graphs which builds on the seminal results of Robertson and Seymour on graph minors. Graph minors provide a list of powerful theoretical results and tools. However, the widespread opinion in the graph algorithms community about this theory is that it is of mainly theoretical importance. In this paper we show how deep min-max and duality theorems from graph minors can be used to obtain exponential speed-up to many known practical algorithms for different domination problems. Our use of branch-width instead of the usual tree-width allows us to obtain much faster algorithms. By using this approach, we show that the k-dominating set problem on planar graphs can be solved in time O(2(15.13 root k) + n(3)).
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available