21 search results - page 1 / 5 » Linear Time Algorithms for Finding a Dominating Set of Fixed... |
COCOON
2007
Springer
13 years 12 months ago
2007
Springer
SODA
2012
ACM
11 years 8 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
ACSC
2007
IEEE
14 years 5 days ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
COCOA
2008
Springer
13 years 7 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...