Login / Signup
Towards single face shortest vertex-disjoint paths in undirected planar graphs.
Glencora Borradaile
Amir Nayyeri
Farzad Zafarani
Published in:
CoRR (2015)
Keyphrases
</>
undirected graph
disjoint paths
planar graphs
directed graph
approximation algorithms
connected components
spanning tree
shortest path
pairwise
minimum cost
minimum weight
tree structure
complex networks
graph structure