A lower bound for area-universal graphs

DOI10.1016/0020-0190(94)00070-0zbMath0942.68643OpenAlexW2031574364MaRDI QIDQ1332765

Gianfranco Bilardi, Shiva P. Chaudhuri, Kurt Mehlhorn, Devdatt P. Dubhashi

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)

Related Items (1)

Area-time tradeoffs for universal VLSI circuits

Cites Work

• Unnamed Item
• A framework for solving VLSI graph layout problems

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