Finding monotone paths in edge-ordered graphs.

Ján Katrenic Gabriel Semanisin

Published in: Discret. Appl. Math. (2010)

Keyphrases

disjoint paths
weighted graph
undirected graph
directed graph
shortest path
strongly connected
edge detection
upper bound
edge information
graph theoretic
minimum spanning trees
graph matching
path finding
maximum clique