One-layer routing without component constraints

DOI10.1016/0022-0000(84)90022-9zbMATH Open0576.94034OpenAlexW2061110962MaRDI QIDQ1065762FDOQ1065762

Authors: Errol L. Lloyd, S. S. Ravi 

Publication date: 1984

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(84)90022-9

Recommendations

• scientific article; zbMATH DE number 4077133
• Optimal Three-Layer Channel Routing
• A Provably Good Algorithm for the Two Module Routing Problem
• scientific article; zbMATH DE number 3907789
• Nearly optimal algorithms and bounds for multilayer channel routing

zbMATH Keywords

printed circuit boardpolynomial-time algorithmsVLSIwiringoptimal layouts

Mathematics Subject Classification ID

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

Cited In (8)

• A Provably Good Algorithm for the Two Module Routing Problem
• Single bend wiring
• An Approach to Gate Assignment and Module Placement for Printed Wiring Boards
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient breakout routing in printed circuit boards (extended abstract)
• The benefits of external wires in single row routing
• Single-layer channel routing and placement with single-sided nets

This page was built for publication: One-layer routing without component constraints

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