On the maximum edge length in VLSI layouts of complete binary trees
From MaRDI portal
Publication:1081305
DOI10.1016/0020-0190(86)90124-9zbMath0601.68041OpenAlexW2049660629MaRDI QIDQ1081305
Publication date: 1986
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(86)90124-9
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)
Cites Work
This page was built for publication: On the maximum edge length in VLSI layouts of complete binary trees
