Sciweavers

Share
2 search results - page 1 / 1
» Dominating sets in planar graphs: branch-width and exponenti...
Sort
View
TAMC
2009
Springer
9 years 10 months ago
On Parameterized Exponential Time Complexity
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
Jianer Chen, Iyad A. Kanj, Ge Xia
books