Book ChapterDOI
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs
Dorothea Wagner,Karsten Weihe +1 more
- pp 384-395
Reads0
Chats0
TLDR
A new approach to the problem of finding edge-disjoint paths in a planar, undirected graph with “classical” case where an instance must additionally fulfill the so-called evenness-condition is introduced.Abstract:
In this paper we discuss the problem of finding edge-disjoint paths in a planar, undirected graph s.t. each path connects two specified vertices on the outer face boundary. We will focus on the “classical” case where an instance must additionally fulfill the so-called evenness-condition. The fastest algorithm for this problem known from the literature requires \(\mathcal{O}\left( {n^{{5 \mathord{\left/{\vphantom {5 3}} \right.\kern-\nulldelimiterspace} 3}} \left( {\log \log n} \right)^{{1 \mathord{\left/{\vphantom {1 3}} \right.\kern-\nulldelimiterspace} 3}} } \right)\) time, where n denotes the number of vertices. In this paper now, we introduce a new approach to this problem, which yields an \(\mathcal{O}\left( n \right)\) algorithm.read more
Citations
More filters
Proceedings ArticleDOI
Approximations for the disjoint paths problem in high-diameter planar networks
Jon Kleinberg,Éva Tardos +1 more
TL;DR: These algorithms provide O(logn)-approximation algorithms for two natural optimization versions of this problem for the class of nearly-Eulerian, uniformly high-diameter planar graphs, which includes two-dimensional meshes and other common planar interconnection networks.
Journal ArticleDOI
Length-bounded cuts and flows
Georg Dr. Baier,Thomas Erlebach,Alexander Hall,Ekkehard Köhler,Petr Kolman,Ondřej Pangrác,Heiko Schilling,Martin Skutella +7 more
TL;DR: In this paper, it was shown that the minimum length-bounded cut problem is NP-hard to approximate within a factor of 1.1377 for L ≥ 5 in the case of node-cuts and for L≥ 4 in the cases of edge-cuts.
Journal ArticleDOI
The edge-disjoint path problem is NP-complete for series-parallel graphs
TL;DR: It is shown that the edge-disjoint paths problem is NP-complete for series–parallel graphs and for partial 2-trees although the problem is trivial for trees and can be solved for outerplanar graphs in polynomial time.
Journal ArticleDOI
Paths of bounded length and their cuts: Parameterized complexity and algorithms
TL;DR: The results indicate that the bounded length disjoint-path variants are structurally harder than their bounded length cut counterparts and it appears that the edge variants are tougher than their vertex-disjoint counterparts when parameterized by the treewidth of the input graph.
Journal ArticleDOI
A linear-time algorithm for edge-disjoint paths in planar graphs
Dorothea Wagner,Karsten Weihe +1 more
TL;DR: A new approach to the problem of finding edge-disjoint paths in a planar, undirected graph such that each path connects two specified vertices on the boundary of the graph is introduced, which results in anO(n) algorithm.
References
More filters
Book
Integer Programming and Network Flows
TL;DR: Interestingly, integer programming and network flows that you really wait for now is coming, it's significant to wait for the representative and beneficial books to read.
Journal ArticleDOI
A linear-time algorithm for a special case of disjoint set union
Harold N. Gabow,Robert E. Tarjan +1 more
TL;DR: A linear-time algorithm for the special case of the disjoint set union problem in which the structure of the unions (defined by a “union tree”) is known in advance that is useful in finding maximum cardinality matchings in nonbipartite graphs.
Journal ArticleDOI
Fast algorithms for shortest paths in planar graphs, with applications
TL;DR: In this article, graph decomposition and data structures techniques are presented that exploit the structure of planar graphs to yield faster algorithms for a number of shortest path problems and related problems.
Proceedings ArticleDOI
A linear-time algorithm for a special case of disjoint set union
Harold N. Gabow,Robert E. Tarjan +1 more
TL;DR: A linear-time algorithm for the special case of the disjoint set union problem in which the structure of the unions (defined by a “union tree”) is known in advance, which gives similar improvements in the efficiency of algorithms for solving a number of other problems.
Journal ArticleDOI
A class of algorithms which require nonlinear time to maintain disjoint sets
TL;DR: A model intended to be useful in deriving realistic complexity bounds for tasks requiring list processing is described, and a class of algorithms which compute unions of disjoint sets on-line are defined, proving that any such algorithm requires nonlinear time in the worst case.