Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

98

Voted

CORR
2008
Springer

74views Education» more CORR 2008»

Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs

15 years 2 months ago

Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs

Download www.di.ens.fr

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 with s; let t1, . . . , tk be vertices incident with t. We give an algorithm to compute k pairwise vertex-disjoint paths connecting the pairs (si, ti) in G, with minimal total length, in O(kn log n) time.

Éric Colin de Verdière, Alexander Sc

Real-time Traffic

CORR 2008 | Directed Planar Graph | Distinct Faces | Education | Nonnegative Length |

claim paper

Related Content

» Vertex Disjoint Paths for Dispatching in Railways

» On Shortest Disjoint Paths in Planar Graphs

» MultipleSource Shortest Paths in Embedded Graphs

» Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs

» Maximum Flows and Parametric Shortest Paths in Planar Graphs

» A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs

» Exact Shortest Path Queries for Planar Graphs Using Linear Space

» Counting Subgraphs via Homomorphisms

» Planar graphs negative weight edges shortest paths and near linear time

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Éric Colin de Verdière, Alexander Schrijver

Comments (0)