Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Shortest vertex-disjoint two-face paths in planar graphs

Shortest vertex-disjoint two-face paths in planar graphs Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs ` ERIC COLIN DE VERDIERE, Ecole Normale Sup rieure and CNRS e ALEXANDER SCHRIJVER, Centrum voor Wiskunde en Informatica 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. Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical algorithms and problems ”Computations on discrete structures; routing and layout; G.2.2 [Discrete Mathematics]: Graph Theory ”Graph algorithms; network problems; path and circuit problems General Terms: Algorithms, Performance, Theory Additional Key Words and Phrases: Algorithm, disjoint paths, planar graph, shortest path ACM Reference Format: Colin de Verdi` re, E. and Schrijver, A. 2011. Shortest vertex-disjoint two-face paths in planar graphs. ACM e Trans. Algor. 7, 2, Article 19 (March 2011), 12 pages. DOI = 10.1145/1921659.1921665 http://doi.acm.org/10.1145/1921659.1921665 1. INTRODUCTION The vertex-disjoint paths http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Algorithms (TALG) Association for Computing Machinery

Shortest vertex-disjoint two-face paths in planar graphs

Loading next page...
 
/lp/association-for-computing-machinery/shortest-vertex-disjoint-two-face-paths-in-planar-graphs-tunsoeQ6qU

References (23)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2011 by ACM Inc.
ISSN
1549-6325
DOI
10.1145/1921659.1921665
Publisher site
See Article on Publisher Site

Abstract

Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs ` ERIC COLIN DE VERDIERE, Ecole Normale Sup rieure and CNRS e ALEXANDER SCHRIJVER, Centrum voor Wiskunde en Informatica 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. Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical algorithms and problems ”Computations on discrete structures; routing and layout; G.2.2 [Discrete Mathematics]: Graph Theory ”Graph algorithms; network problems; path and circuit problems General Terms: Algorithms, Performance, Theory Additional Key Words and Phrases: Algorithm, disjoint paths, planar graph, shortest path ACM Reference Format: Colin de Verdi` re, E. and Schrijver, A. 2011. Shortest vertex-disjoint two-face paths in planar graphs. ACM e Trans. Algor. 7, 2, Article 19 (March 2011), 12 pages. DOI = 10.1145/1921659.1921665 http://doi.acm.org/10.1145/1921659.1921665 1. INTRODUCTION The vertex-disjoint paths

Journal

ACM Transactions on Algorithms (TALG)Association for Computing Machinery

Published: Mar 1, 2011

There are no references for this article.