Login / Signup
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones.
Robert Janczewski
Krzysztof Turowski
Published in:
Inf. Process. Lett. (2015)
Keyphrases
</>
bounded degree
computational complexity
graph theoretic
bounded treewidth
np complete
connected dominating set
undirected graph
special case
neighborhood graph
graph theory
decision problems
minimum spanning tree
np hard
high computational complexity
connected components
graph matching
weighted graph
directed graph