A framework for 1-D compaction with forbidden region avoidance

DOI10.1016/0925-7721(92)90002-AzbMath0748.68085OpenAlexW4240080541MaRDI QIDQ1194311

Susanne E. Hambrusch, Hung-Yi Tu

Publication date: 27 September 1992

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(92)90002-a

zbMATH Keywords

forbidden regionsvisibility graphscompaction problemVLSI layouts

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Circuits, networks (94C99) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Related Items (1)

Shortest path computations in source-deplanarized graphs

Cites Work

• Filtering Search: A New Approach to Query-Answering
• A mixed-integer linear programming problem which is efficiently solvable
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A framework for 1-D compaction with forbidden region avoidance