Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs

Details Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs

2008-02-20

arxiv.org/abs/0802.2845v1

Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (

Computer Science

Data Structures and Algorithms

Scientific paper

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 $s_1,...,s_k$ be vertices incident with $s$; let $t_1,...,t_k$ be vertices incident with $t$. We give an algorithm to compute $k$ pairwise vertex-disjoint paths connecting the pairs $(s_i,t_i)$ in $G$, with minimal total length, in $O(kn\log n)$ time.

Affiliated with

Also associated with

No associations

Rating

Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-647812