Maximum Edge-Disjoint Paths in k-Sums of Graphs.

Chandra Chekuri Guyslain Naves F. Bruce Shepherd

Published in: ICALP (1) (2013)

Keyphrases

disjoint paths
undirected graph
directed graph
approximation algorithms
graph structure
graph structures
connected components
minimum cost
directed acyclic graph
spanning tree
graph theory
random walk
special case
graph mining
data sets
maximum number
graph theoretic
random graphs
multi dimensional