A parallel algorithm for channel routing problems (VLSI)
- 1 April 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 11 (4), 464-474
- https://doi.org/10.1109/43.125094
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- A parallel algorithm for solving the ‘Hip’ gamesNeurocomputing, 1991
- A parallel algorithm for tiling problemsIEEE Transactions on Neural Networks, 1990
- Parallel algorithms for finding a near-maximum independent set of a circle graphIEEE Transactions on Neural Networks, 1990
- A super-parallel sorting algorithm based on neural networksIEEE Transactions on Circuits and Systems, 1990
- Parallel global routing for standard cellsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- A Near-Optimum Parallel Planarization AlgorithmScience, 1989
- A Permeation RouterIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- A Class of Array Architectures for Hardware Grid RoutersIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- A New Symbolic Channel Router: YACR2IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Three-Layer Channel RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1984