Sciweavers

CORR
2008
Springer
74views Education» more  CORR 2008»
14 years 12 days ago
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
Éric Colin de Verdière, Alexander Sc...