Affiliation:
1. Technische Universität Darmstadt, Darmstadt, Germany
2. University of Newcastle, Callaghan, NSW, Australia
Abstract
By a
switch graph
, we mean an undirected graph
G
= (
P
⊍
W
,
E
) such that all vertices in
P
(the
plugs
) have degree one and all vertices in
W
(the
switches
) have even degrees. We call
G
plane
if
G
is planar and can be embedded such that all plugs are in the outer face. Given a set (
s
1
,
t
1
), …,(
s
k
,
t
k
) of pairs of plugs, the problem is to find edge-disjoint paths
p
1
, …,
p
k
such that every
p
i
connects
s
i
with
t
i
. The best asymptotic worst-case complexity known so far is quadratic in the number of vertices. In this article, a linear, and thus asymptotically optimal, algorithm is introduced. This result may be viewed as a concluding "keystone" for a number of previous results on various special cases of the problem.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting;Theoretical Computer Science;2010-06
2. SWITCHING GRAPHS;International Journal of Foundations of Computer Science;2009-10
3. Switching Graphs;Electronic Notes in Theoretical Computer Science;2008-12
4. The weighted link ring loading problem;Journal of Combinatorial Optimization;2008-01-05