Sciweavers

ENDM
2010
122views more  ENDM 2010»
13 years 4 months ago
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
Vinícius G. P. de Sá, Celina M. Herr...
FCS
2006
13 years 6 months ago
VLSI Layout of Benes Networks
Paul Manuel, Kalim Qureshi, Albert William, Albert...