3-dimensional single active layer routing

DOI10.1007/3-540-47738-1_30MaRDI QIDQ4547820zbMATH OpenFDO

Authors András Recski, Dávid Szeszlér

Publication date 21 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2098/20980318

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal Three-Layer Channel Routing
• scientific article; zbMATH DE number 4077133
• Nearly optimal algorithms and bounds for multilayer channel routing
• Minimum separation for single-layer channel routing
• scientific article; zbMATH DE number 3907789

Cited in

(6)

• Minimum separation for single-layer channel routing
• Hexagonal three-layer channel routing
• scientific article; zbMATH DE number 4077133 (Why is no real title available?)
• A three-layer over-the-cell multi-channel router for a new cell model
• Routing in a three-dimensional chip
• Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI

This page was built for publication: 3-dimensional single active layer routing

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