Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2.

Loïc Seguin-Charbonneau F. Bruce Shepherd

Published in: FOCS (2011)

Keyphrases

disjoint paths
planar graphs
undirected graph
approximation algorithms
directed graph
connected components
complex networks
spanning tree
special case
approximate inference
directed acyclic graph
image segmentation
graph structure
minimum weight