A strengthened analysis of an algorithm for Dominating Set in planar graphs

Authors:
Torben Hagerup
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 8
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Parameterized Algorithms for Planar Dominating Set

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Polynomial-time data reduction for dominating set

Journal of the ACM (JACM)
Parameterized complexity: exponential speed-up for planar graph problems

Journal of Algorithms
A refined search tree technique for Dominating Set on planar graphs

Journal of Computer and System Sciences
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up

SIAM Journal on Computing
Dynamic programming and fast matrix multiplication

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.04

Visualization

Abstract

Alber et al. presented an algorithm for computing a dominating set of size at most k, if one exists, in an undirected planar n-vertex graph and bounded its execution time by O(8^kn). Here it is shown that the algorithm performs better than claimed by its authors. More significantly, if k@?n/19, even a much simplified version of the algorithm runs in O(7^kn) time.