On the complexity of path problems in properly colored directed graphs.

Donatella Granata Behnam Behdani Panos M. Pardalos

Published in: J. Comb. Optim. (2012)

Keyphrases

directed graph
decision problems
problems involving
solving problems
shortest path problem
neural network
information systems
computational complexity
special case
np complete
directed acyclic graph
np hardness
disjoint paths