Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear Time.

Published in: ESA (1994)

Keyphrases

planar graphs
edge disjoint
spanning tree
undirected graph
weighted graph
minimum weight
shortest path
minimum cost
total length
minimum spanning tree
worst case
approximation algorithms
np hard
approximate inference
optimal solution
latent variables
times faster
running times
boundary points
higher order