2022
DOI: 10.48550/arxiv.2205.00086
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Enumerating Connected Dominating Sets

Abstract: The question to enumerate all (inclusion-wise) minimal connected dominating sets in a graph of order n in time significantly less than 2 n is an open question that was asked in many places. We answer this question affirmatively, by providing an enumeration algorithm that runs in time O(1.9896 n ), using polynomial space only. The key to this result is the consideration of this enumeration problem on 2-degenerate graphs, which is proven to be possible in time O(1.9767 n ). Apart from solving this old open quest… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 23 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?