On the maximum disjoint paths problem on edge-colored graphs.

Published in: Discret. Optim. (2012)

Keyphrases

disjoint paths
undirected graph
directed graph
approximation algorithms
random walk
spanning tree
random graphs
weighted graph
graph theory
neural network
complex networks
graph structure
graph theoretic
minimum spanning trees
series parallel
graph structures
graph matching
markov chain