Journal of the ACM (JACM) - The MIT Press scientific computation series
Routing through a generalized switchbox
Journal of Algorithms
Algorithms for routing in planar graphs
Acta Informatica
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Edge-Disjoint Routing in Plane Switch Graphs in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
Theoretical Computer Science
| Hi-index | 0.01 |
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 (s1, t1), …,(sk, tk) of pairs of plugs, the problem is to find edge-disjoint paths p1, …, pk such that every pi connects si with ti. 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.