Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes.
Hiroshi EtoHiroyuki KawaharaEiji MiyanoNatsuki NonouePublished in: IEICE Trans. Inf. Syst. (2018)
Keyphrases
- tractable cases
- computational complexity
- equivalence classes
- connected dominating set
- graph representation
- random walk
- graph theory
- complexity measures
- directed graph
- dependency graph
- dominating set
- graph structure
- link analysis
- directed acyclic graph
- spanning tree
- decision problems
- polynomial time complexity
- data sets