Back to Search
Start Over
BELOW ALL SUBSETS FOR MINIMAL CONNECTED DOMINATING SET.
- Source :
-
SIAM Journal on Discrete Mathematics . 2018, Vol. 32 Issue 3, p2332-2345. 14p. - Publication Year :
- 2018
-
Abstract
- A vertex subset S in a graph G is a dominating set if every vertex not contained in S has a neighbor in S. A dominating set S is a connected dominating set if the subgraph G[S] induced by S is connected. A connected dominating set S is a minimal connected dominating set if no proper subset of S is also a connected dominating set. We prove that there exists a constant \epsilon ∊10-50 such that every graph G on n vertices has at most O(2(1-∊)n) minimal connected dominating sets. For the same ∊ we also give an algorithm with running time 2(1-∊)n· nO(1) to enumerate all minimal connected dominating sets in an input graph G. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 32
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 132351611
- Full Text :
- https://doi.org/10.1137/17M1138753