Login / Signup

Shortest vertex-disjoint two-face paths in planar graphs.

Éric Colin de VerdièreAlexander Schrijver
Published in: ACM Trans. Algorithms (2011)
Keyphrases
  • planar graphs
  • minimum weight
  • shortest path
  • undirected graph
  • bipartite graph
  • weighted graph
  • pairwise
  • directed graph
  • lower bound
  • connected components
  • minimum spanning tree
  • greedy heuristic