Complexity of Finding k-Path-Free Dominating Sets in Graphs.

Reuven Bar-Yehuda Uzi Vishkin

Published in: Inf. Process. Lett. (1982)

Keyphrases

worst case
strongly connected
computational complexity
directed graph
series parallel
real time
neural network
shortest path
path planning
graph structure
minimum cost
spanning tree
graph representation
multiobjective optimization