This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Feb. 1981 (vol. 30 no. 2)
pp. 135-140
Leslie G. Valiant, Department of Computer Science, University of Edinburgh, Edinburgh, Scotland
The problem of embedding the interconnection pattern of a circuit into a two-dimensional surface of minimal area is discussed. Since even for some natural patterns graphs containing m connections may require Ω(m2) area, in order to achieve compact embeddings restricted classes of graphs have to be considered. For example, arbitrary trees (of bounded degree) can be embedded in linear area without edges crossing over. Planar graphs can be embedded efficiently only if crossovers are allowed in the embedding.
Index Terms:
VLSI,Area minimization,circuits,embeddings,graphs,universality
Citation:
Leslie G. Valiant, "Universality considerations in VLSI circuits," IEEE Transactions on Computers, vol. 30, no. 2, pp. 135-140, Feb. 1981, doi:10.1109/TC.1981.6312176
Usage of this product signifies your acceptance of the Terms of Use.