OPTIMAL ROUTING THROUGH DENSE CHANNELS

DOI10.1142/S0218195993000178zbMath0804.68069OpenAlexW2157330053MaRDI QIDQ4294715

Dorothea Wagner

Publication date: 18 May 1994

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195993000178

zbMATH Keywords

layer assignmentnumber of bendsVLSI-designwire lengthcycle graphsknock-knee channel routing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Applications of graph theory to circuits and networks (94C15)

Related Items (2)

Optimizing area for three-layer knock-knee channel routing ⋮ A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works

This page was built for publication: OPTIMAL ROUTING THROUGH DENSE CHANNELS