Edge-disjoint paths in planar graphs

Research output: Contribution to journalArticle

52 Citations (Scopus)

Abstract

Given a planar graph G = (V, E), find k edge-disjoint paths in G connecting k pairs of terminals specified on the outer face of G. Generalizing earlier results of Okamura and Seymour (J. Combin. Theory Ser. B 31 (1981), 75-81) and of the author (Combinatorica 2, No. 4 (1982), 361-371), we solve this problem when each node of G not on the outer face has even degree. The solution involves a good characterization for the solvability and the proof gives rise to an algorithm of complexity O(|V|3log|V|). In particular, the integral multicommodity flow problem is proved to belong to the problem class P when the underlying graph is outerplanar.

Original languageEnglish
Pages (from-to)164-178
Number of pages15
JournalJournal of Combinatorial Theory. Series B
Volume39
Issue number2
DOIs
Publication statusPublished - 1985

Fingerprint

Edge-disjoint Paths
Planar graph
Face
Multicommodity Flow
Solvability
Graph in graph theory
Vertex of a graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Edge-disjoint paths in planar graphs. / Frank, A.

In: Journal of Combinatorial Theory. Series B, Vol. 39, No. 2, 1985, p. 164-178.

Research output: Contribution to journalArticle

@article{e8cfebb04f114752a36dd50d58b68b8c,
title = "Edge-disjoint paths in planar graphs",
abstract = "Given a planar graph G = (V, E), find k edge-disjoint paths in G connecting k pairs of terminals specified on the outer face of G. Generalizing earlier results of Okamura and Seymour (J. Combin. Theory Ser. B 31 (1981), 75-81) and of the author (Combinatorica 2, No. 4 (1982), 361-371), we solve this problem when each node of G not on the outer face has even degree. The solution involves a good characterization for the solvability and the proof gives rise to an algorithm of complexity O(|V|3log|V|). In particular, the integral multicommodity flow problem is proved to belong to the problem class P when the underlying graph is outerplanar.",
author = "A. Frank",
year = "1985",
doi = "10.1016/0095-8956(85)90046-2",
language = "English",
volume = "39",
pages = "164--178",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Edge-disjoint paths in planar graphs

AU - Frank, A.

PY - 1985

Y1 - 1985

N2 - Given a planar graph G = (V, E), find k edge-disjoint paths in G connecting k pairs of terminals specified on the outer face of G. Generalizing earlier results of Okamura and Seymour (J. Combin. Theory Ser. B 31 (1981), 75-81) and of the author (Combinatorica 2, No. 4 (1982), 361-371), we solve this problem when each node of G not on the outer face has even degree. The solution involves a good characterization for the solvability and the proof gives rise to an algorithm of complexity O(|V|3log|V|). In particular, the integral multicommodity flow problem is proved to belong to the problem class P when the underlying graph is outerplanar.

AB - Given a planar graph G = (V, E), find k edge-disjoint paths in G connecting k pairs of terminals specified on the outer face of G. Generalizing earlier results of Okamura and Seymour (J. Combin. Theory Ser. B 31 (1981), 75-81) and of the author (Combinatorica 2, No. 4 (1982), 361-371), we solve this problem when each node of G not on the outer face has even degree. The solution involves a good characterization for the solvability and the proof gives rise to an algorithm of complexity O(|V|3log|V|). In particular, the integral multicommodity flow problem is proved to belong to the problem class P when the underlying graph is outerplanar.

UR - http://www.scopus.com/inward/record.url?scp=0001002826&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0001002826&partnerID=8YFLogxK

U2 - 10.1016/0095-8956(85)90046-2

DO - 10.1016/0095-8956(85)90046-2

M3 - Article

VL - 39

SP - 164

EP - 178

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 2

ER -