Factoring directed graphs with respect to the cardinal product in polynomial time.

Wilfried Imrich Werner Klöckl

Published in: Discuss. Math. Graph Theory (2007)

Keyphrases

directed graph
random walk
special case
directed acyclic graph
undirected graph
computational complexity
graph structure
directed edges
disjoint paths
worst case
connected regions
maximum flow
product design
approximation algorithms
neural network
life cycle
search algorithm
search engine