Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI

DOI10.1016/j.dam.2006.05.010zbMath1110.68114OpenAlexW2128137359MaRDI QIDQ858297

Dávid Szeszlér, András Recski

Publication date: 9 January 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.05.010

zbMATH Keywords

VLSI layout3-D routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Uses Software

• BEAVER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound on the area of permutation layouts
• Optimal book embeddings of the FFT, Benes, and barrel shifter networks
• Computer science today. Recent trends and developments
• Unconstrained multilayer switchbox routing
• Three-Dimensional VLSI
• Three-Dimensional Circuit Layouts
• Permutation layout
• Channel routing of multiterminal nets
• Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
• A Theorem on Coloring the Lines of a Network

This page was built for publication: Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI