A lower bound for area-universal graphs

DOI10.1016/0020-0190(94)00070-0zbMATH Open0942.68643OpenAlexW2031574364MaRDI QIDQ1332765FDOQ1332765

Authors: Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, K. Mehlhorn 

Publication date: 2 August 2000

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-B75A-4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites Work

• A framework for solving VLSI graph layout problems
• Title not available (Why is that?)

Cited In (1)

• Area-time tradeoffs for universal VLSI circuits

This page was built for publication: A lower bound for area-universal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1332765)