A lower bound on the area of permutation layouts
- 1 June 1991
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 6 (2) , 241-255
- https://doi.org/10.1007/bf01759044
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Multilayer grid embeddings for VLSIAlgorithmica, 1991
- Expanding graphs contain all small treesCombinatorica, 1987
- Eigenvalues and expandersCombinatorica, 1986
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985
- Multi-layer grid embeddingsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- New lower bound techniques for VLSITheory of Computing Systems, 1984
- On optimum single-row routingIEEE Transactions on Circuits and Systems, 1979
- Permutation layoutNetworks, 1978
- Thickness of graphs with degree constrained verticesIEEE Transactions on Circuits and Systems, 1977
- Optimal Rearrangeable Multistage Connecting NetworksBell System Technical Journal, 1964