Name
Abstract | ||
|---|---|---|
For a connected graph $G$ we call a set $mathcal{F}$ a spanning tree factoring of $G$ if it contains all spanning trees of $G$. A subset $Ssubseteq V(G)$ is a simultaneous dominating set of $G$ if it is a dominating set in every spanning tree in $mathcal{F}$. We consider the problem of finding a minimum size simultaneous dominating set for spanning tree factorings. We show that the decision version of this problem is NP-complete by pointing out its close relation to the vertex cover problem. We present an exact algorithm to solve this problem and show how to solve it in polynomial time on some graph classes like bipartite or chordal graphs. Moreover, we derive a $2$-approximation algorithm for this problem. |
Year | Venue | DocType |
|---|---|---|
2018 | arXiv: Combinatorics | Journal |
Volume | Citations | PageRank |
abs/1810.12887 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sebastian S. Johann | 1 | 0 | 0.34 |
| Sven O. Krumke | 2 | 308 | 36.62 |
| Manuel Streicher | 3 | 0 | 0.34 |