Universal Chains and Wiring Layouts

DOI10.1137/0401009MaRDI QIDQ3792252zbMATH OpenOpenAlexFDO

Authors

Publication date 1988

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL http://wrap.warwick.ac.uk/60773/12/WRAP_cs-rr-074.pdf

zbMATH Keywords

routingsequencingVLSIcircuit boardsuniversal chainwiring layouts

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On a universal chain problem
• Optimal layouts on a chain ATM network
• Layouts with wires of balanced length
• scientific article; zbMATH DE number 3906407
• A unified approach to layout wirability

Cited in

(3)

• A lower bound on the area of permutation layouts
• On a universal chain problem
• Multilayer grid embeddings for VLSI

This page was built for publication: Universal Chains and Wiring Layouts

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