MPI-INF Logo
MPI-INF/SWS Research Reports 1991-2021

2. Number - All Departments

MPI-I-93-144

A lower bound for area-universal graphs

Bilardi, G. and Chaudhuri, Shiva and Dubhashi, Devdatt P. and Mehlhorn, Kurt

October 1993, 7 pages.

.
Status: available - back from printing

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 \leq \sqrt{A}/\log\log A$ satisfies the tradeoff $$ A_u = \Omega ( A \log A / (c^2 \log (2d)) ). $$ In particular, if $A_u = O(A)$ then $\max(c,d) = \Omega(\sqrt{\log A} / \log\log A)$.

URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1993-144

Hide details for BibTeXBibTeX
@TECHREPORT{BilardiChaudhuriDubhashiMehlhorn93,
  AUTHOR = {Bilardi, G. and Chaudhuri, Shiva and Dubhashi, Devdatt P. and Mehlhorn, Kurt},
  TITLE = {A lower bound for area-universal graphs},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-93-144},
  MONTH = {October},
  YEAR = {1993},
  ISSN = {0946-011X},
}