VLSI routing in polynomial time

zbMATH Open1430.68012MaRDI QIDQ2816135

András Recski

Publication date: 1 July 2016

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065305801842?np=y

zbMATH Keywords

VLSI designchannel routingdetailed routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

On routing in VLSI design and communication networks ⋮ Switchbox routing in VLSI design: Closing the complexity gap

Recommendations

• On routing in VLSI design and communication networks 👍 👎
• A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing 👍 👎
• Routing in VLSI-layout 👍 👎
• The VLSI Complexity of Selected Graph Problems 👍 👎
• Algorithms and Computation 👍 👎
• Some polynomially solvable subcases of the detailed routing problem in VLSI design 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: VLSI routing in polynomial time

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