Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-I-93-144

A lower bound for area-universal graphs

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

MPI-I-93-144. October 1993, 7 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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)$.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-93-144.pdfMPI-I-93-144.pdf9753 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://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},
}