Parallel Algorithms for Channel Routing in the Knock-Knee Model

DOI10.1137/0220014zbMATH Open0722.68060OpenAlexW1969031421MaRDI QIDQ3210179FDOQ3210179

Authors: Shing-Chong Chang, Joseph Ja'Ja' 

Publication date: 1991

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1903/4756

Recommendations

• An efficient parallel logarithmic time algorithm for the channel routing problem
• scientific article; zbMATH DE number 3907789
• Channel routing in knock-knee mode: Simplified algorithms and proofs
• Optimizing area for three-layer knock-knee channel routing
• Optimal Three-Layer Channel Routing

zbMATH Keywords

parallel algorithmslayoutVLSI designchannel routingline packingleft-edge algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Cited In (6)

• Channel routing in knock-knee mode: Simplified algorithms and proofs
• A parallel algorithm for channel routing
• Channel routing in a diagonal overlap model
• An efficient parallel logarithmic time algorithm for the channel routing problem
• Parity conditions in homotopic knock-knee routing
• A parallel multi-layer channel router on the HVH model

This page was built for publication: Parallel Algorithms for Channel Routing in the Knock-Knee Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210179)