Optimal Placement for River Routing
From MaRDI portal
Publication:3657933
DOI10.1137/0212029zbMath0512.94029OpenAlexW4232328109MaRDI QIDQ3657933
Charles E. Leiserson, Ron Yair Pinter
Publication date: 1983
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0212029
graph theoryanalysis of algorithmslongest pathsdesign automationplacement and routingriver routinglayout of integrated circuits
Analysis of algorithms (68W40) Applications of graph theory to circuits and networks (94C15) Switching theory, applications of Boolean algebras to circuits and networks (94C11)
Related Items (11)
Computing minimum length paths of a given homotopy class ⋮ On BF-orderable graphs ⋮ River routing in VLSI ⋮ Trapezoid graphs and their coloring ⋮ Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing ⋮ Offset range problem for two blocks ⋮ A direct linear-time planarity test for unflippable modules ⋮ Minimum area joining of k compacted cells ⋮ Single jog minimum area joining of compacted cells ⋮ Single-layer channel routing and placement with single-sided nets ⋮ DRAWING WITH FAT EDGES
This page was built for publication: Optimal Placement for River Routing
