Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs.

Published in: Electron. Notes Discret. Math. (2005)

Keyphrases

disjoint paths
planar graphs
undirected graph
rooted trees
approximation algorithms
directed graph
spanning tree
minimum cost
connected components
directed acyclic graph
tree mining
graph structure
complex networks
approximate inference
latent variables
np hard
special case
worst case