English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  A lower bound for area-universal graphs

Bilardi, G., Chaudhuri, S., Dubhashi, D. P., & Mehlhorn, K.(1993). A lower bound for area-universal graphs (MPI-I-93-144). Saarbrücken: Max-Planck-Institut für Informatik.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-B75A-4 Version Permalink: https://hdl.handle.net/21.11116/0000-0001-AF17-1
Genre: Report

Files

show Files
hide Files
:
MPI-I-93-144.pdf (Any fulltext), 10MB
View   Save
File Permalink:
https://hdl.handle.net/11858/00-001M-0000-0027-83CE-A
Name:
MPI-I-93-144.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Bilardi, G.1, Author
Chaudhuri, Shiva1, Author           
Dubhashi, Devdatt P., Author
Mehlhorn, Kurt1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: 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)$.

Details

show
hide
Language(s): eng - English
 Dates: 1993
 Publication Status: Issued
 Pages: 7 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: Report Nr.: MPI-I-93-144
BibTex Citekey: MPI-I-93-144
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -