The VLSI Complexity of Selected Graph Problems
From MaRDI portal
Publication:3768399
DOI10.1145/62.70zbMath0631.68039MaRDI QIDQ3768399
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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
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