On local routing of two-terminal nets
- 1 May 1992
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 55 (1) , 33-72
- https://doi.org/10.1016/0095-8956(92)90031-r
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Edge-disjoint homotopic paths in a planar graph with one holeJournal of Combinatorial Theory, Series B, 1990
- Routing through a generalized switchboxJournal of Algorithms, 1986
- Algorithms for routing in planar graphsActa Informatica, 1986
- Planar Multicommodity Fows, Maximum Matchings and Negative CyclesSIAM Journal on Computing, 1986
- Routing through a rectangleJournal of the ACM, 1986
- A Linear-Time Routing Algorithm for Convex GridsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- River Routing Every Which Way, But LoosePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Disjoint paths in a rectilinear gridCombinatorica, 1982
- Three layers are enoughPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Multicommodity flows in planar graphsJournal of Combinatorial Theory, Series B, 1981