Name
Abstract | ||
|---|---|---|
We provide an algorithm for listing all minimal double dominating sets of a tree of order n in time O(1.3248(n)). This implies that every tree has at most 1.3248(n) minimal double dominating sets. We also show that this bound is tight. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-08016-1_14 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
domination,double domination,minimal double dominating set,tree,combinatorial bound,exact exponential algorithm,listing algorithm | Combinatorics,Mathematics | Conference |
Volume | ISSN | Citations |
8497 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 10 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcin Krzywkowski | 1 | 16 | 6.22 |