Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets.
Michael DorflingWayne GoddardJohannes H. HattinghMichael A. HenningPublished in: Discret. Math. (2005)
Keyphrases
- spanning tree
- random walk
- connected dominating set
- random graphs
- edge disjoint
- graph theoretic
- graph structure
- graph matching
- minimum cut
- graph construction
- graph representation
- neural network
- weighted graph
- graph theory
- connected components
- pairwise
- dominating set
- directed graph
- stable set
- graph partitioning
- graph based algorithm
- closed sets
- minimum spanning tree
- directed acyclic graph
- data structure
- learning algorithm