Skip to main content
Article thumbnail
Location of Repository

A lower bound for area-universal graphs

By G. (Padua Univ. (Italy). Dipt. di Elettronica e Informatica) Bilardi, S. Chaudhuri, D. Dubhashi, Saarbruecken (Germany)) K. (Max-Planck-Institut fuer Informatik Mehlhorn and Saarbruecken (Germany) Max-Planck-Institut fuer Informatik


We establish a lower bound on the efficiency of area-universal circuits. The area A_u of every graph H that can host any graph G of area (at most) A with dilation d, and congestion c#<=##sq root#A/loglog A satisfies the tradeoff A_u #OMEGA#(A log A/(c"2log(2d))). In particular, if A_u = O(A) then max(c,d) #OMEGA#(#sq root#(logA)/loglog A)SIGLEAvailable from TIB Hannover: RR 1912(93-144)+a / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekBundesministerium fuer Forschung und Technologie (BMFT), Bonn (Germany)DEGerman

Topics: 09H - Computer software, programming, GRAPHS: M, EMBEDDINGS, VLSI
Year: 1993
OAI identifier:
Provided by: OpenGrey Repository
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.