Finding a Maximum Planar Subset of a Set of Nets in a Channel
- 1 January 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 6 (1) , 93-94
- https://doi.org/10.1109/tcad.1987.1270250
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Single-Layer Routing for VLSI: Analysis and AlgorithmsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- An optimal solution to a wire-routing problemJournal of Computer and System Sciences, 1981
- Optimal wiring between rectanglesPublished by Association for Computing Machinery (ACM) ,1981
- Algorithms for a maximum clique and a maximum independent set of a circle graphNetworks, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- QUEUES, STACKS AND GRAPHSPublished by Elsevier ,1971