A convex bipartite graph on n vertices has at most O(1.7254^n) minimal connected dominating sets, and all of them can be enumerated within the same time bound.
Below all subsets for minimal connected dominating set
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the maximum number of minimal connected dominating sets in convex bipartite graphs
A convex bipartite graph on n vertices has at most O(1.7254^n) minimal connected dominating sets, and all of them can be enumerated within the same time bound.