Layouts with wires of balanced length

DOI10.1016/0890-5401(87)90039-3zbMath0622.94033OpenAlexW1982599920MaRDI QIDQ1091358

Bernd Becker, H. G. Osthof

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(87)90039-3

zbMATH Keywords

circuitsVLSIgeometrical algorithmsgraphs with fixed boundariesoptimal balanced layouts

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items (2)

How to draw a hypergraph ⋮ The realization problem for Euclidean minimum spanning trees is NP-hard

Cites Work

• Algebraic multigrid (AMG): Experiences and comparisons
• On the Optimal Layout of Planar Graphs with Fixed Boundary
• P-Complete Approximation Problems

This page was built for publication: Layouts with wires of balanced length