A Linear-Time Routing Algorithm for Convex Grids
- 1 January 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 4 (1) , 68-76
- https://doi.org/10.1109/tcad.1985.1270099
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- An Efficient Algorithm for Finding Multicommodity Flows in Planar NetworksSIAM Journal on Computing, 1985
- Disjoint paths in a rectilinear gridCombinatorica, 1982
- Three layers are enoughPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- New Lower Bounds for Channel WidthPublished by Springer Nature ,1981
- Optimal Routing in Rectilinear ChannelsPublished by Springer Nature ,1981
- Provably Good Channel Routing AlgorithmsPublished by Springer Nature ,1981
- Optimal wiring between rectanglesPublished by Association for Computing Machinery (ACM) ,1981
- A “Dogleg” channel routerPublished by Association for Computing Machinery (ACM) ,1976