Switchbox routing in VLSI design: Closing the complexity gap
From MaRDI portal
Recommendations
- Algorithms and Computation
- On routing in VLSI design and communication networks
- Routing in VLSI-layout
- On the optimal four-way switch box routing structures of FPGA greedy routing architectures
- VLSI routing in polynomial time
- Global routing in VLSI design: algorithms, theory, and computational practice
- Peel-the-box: a concept of switch-box routing and tractable problems
Cites work
- scientific article; zbMATH DE number 4191148 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1332659 (Why is no real title available?)
- scientific article; zbMATH DE number 956793 (Why is no real title available?)
- Multicommodity flows in planar graphs
- Routing in grid graphs by cutting planes
- Routing through a Dense Channel with Minimum Total Wire Length
Cited in
(8)- Minimum crosstalk switchbox routing
- Improving size-bounds for subcases of square-shaped switchbox routing
- Peel-the-box: a concept of switch-box routing and tractable problems
- On the complexity of single row routing problems
- On the optimal four-way switch box routing structures of FPGA greedy routing architectures
- scientific article; zbMATH DE number 1941066 (Why is no real title available?)
- Switchbox routing in VLSI design: closing the complexity gap (extended abstract)
- On routing in VLSI design and communication networks
This page was built for publication: Switchbox routing in VLSI design: Closing the complexity gap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274317)
