Algorithms for routing in planar graphs
- 1 May 1986
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 23 (2) , 163-176
- https://doi.org/10.1007/bf00289496
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Routing through a generalized switchboxPublished by Springer Nature ,2005
- Routing through a rectangleJournal of the ACM, 1986
- Edge-disjoint paths in planar graphsJournal of Combinatorial Theory, Series B, 1985
- Remarks as Outgoing EditorIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- On multicommodity flows in planar graphsNetworks, 1984
- Optimal Three-Layer Channel RoutingIEEE Transactions on Computers, 1984
- Disjoint paths in a rectilinear gridCombinatorica, 1982
- Multicommodity flows in planar graphsJournal of Combinatorial Theory, Series B, 1981
- Provably Good Channel Routing AlgorithmsPublished by Springer Nature ,1981