A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Linear Kernel for Planar Connected Dominating Set
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Partitioning Graphs into Connected Parts
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Partitioning graphs into connected parts
Theoretical Computer Science
FPT algorithms and kernels for the Directedk- Leaf problem
Journal of Computer and System Sciences
On Partitioning a Graph into Two Connected Subgraphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
An Amortized Search Tree Analysis for k-Leaf Spanning Tree
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A hybrid graph representation for recursive backtracking algorithms
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
A linear kernel for a planar connected dominating set
Theoretical Computer Science
An exact algorithm for connected red-blue dominating set
Journal of Discrete Algorithms
On parameterized independent feedback vertex set
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
An exact algorithm for the Maximum Leaf Spanning Tree problem
Theoretical Computer Science
On partitioning a graph into two connected subgraphs
Theoretical Computer Science
Max-leaves spanning tree is APX-hard for cubic graphs
Journal of Discrete Algorithms
FPT algorithms for connected feedback vertex set
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
An exact algorithm for connected red-blue dominating set
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem
Journal of Discrete Algorithms
FPT algorithms for Connected Feedback Vertex Set
Journal of Combinatorial Optimization
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
SIAM Journal on Discrete Mathematics
Kernel(s) for problems with no kernel: On out-trees with many leaves
ACM Transactions on Algorithms (TALG)
On Parameterized Independent Feedback Vertex Set
Theoretical Computer Science
Computing the differential of a graph: Hardness, approximability and exact algorithms
Discrete Applied Mathematics
Solving Capacitated Dominating Set by using covering by subsets and maximum matching
Discrete Applied Mathematics
| Hi-index | 0.00 |
In the connected dominating set problem we are given an n-node undirected graph, and we are asked to find a minimum cardinality connected subset S of nodes such that each node not in S is adjacent to some node in S. This problem is also equivalent to finding a spanning tree with maximum number of leaves. Despite its relevance in applications, the best known exact algorithm for the problem is the trivial Ω(2 n ) algorithm that enumerates all the subsets of nodes. This is not the case for the general (unconnected) version of the problem, for which much faster algorithms are available. Such a difference is not surprising, since connectivity is a global property, and non-local problems are typically much harder to solve exactly. In this paper we break the 2n barrier, by presenting a simple O(1.9407 n ) algorithm for the connected dominating set problem. The algorithm makes use of new domination rules, and its analysis is based on the Measure and Conquer technique.