The VLSI Complexity of Selected Graph Problems

DOI10.1145/62.70zbMath0631.68039OpenAlexW1982680330MaRDI QIDQ3768399

Joseph F. Ja'Ja'

Publication date: 1984

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/62.70

zbMATH Keywords

VLSI complexityarea-time trade-offs

Mathematics Subject Classification ID

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

Related Items (3)

Area-time lower-bound techniques with applications to sorting ⋮ On the VLSI complexity of some arithmetic and numerical problems ⋮ Communication complexity and combinatorial lattice theory

This page was built for publication: The VLSI Complexity of Selected Graph Problems