Name
Abstract | ||
|---|---|---|
We provide an algorithm for listing all minimal double dominating sets of a tree of order n in time $\mathcal{O}$1.3248n. This implies that every tree has at most 1.3248n minimal double dominating sets. We also show that this bound is tight. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.3233/FI-2014-998 | Fundam. Inform. |
Keywords | Field | DocType |
order n,minimal double dominating set,dominating sets,tree | Discrete mathematics,Dominating set,Combinatorics,Algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
130 | 4 | 0169-2968 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcin Krzywkowski | 1 | 16 | 6.22 |