Pages that link to "Item:Q3677185"

The following pages link to NP-completeness for minimizing maximum edge length in grid embeddings (Q3677185):

Displaying 9 items.

• Complexity dichotomy on partial grid recognition (Q533881) (← links)
• Lattice bandwidth of random graphs (Q810061) (← links)
• Graph graphics: Theory and practice (Q1103411) (← links)
• The complexity of minimizing wire lengths in VLSI layouts (Q1107990) (← links)
• Unit-length embedding of binary trees on a square grid (Q1120274) (← links)
• The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
• On computational complexity of length embeddability of graphs (Q2629266) (← links)
• The hardness of the grid problemGi Under the Routine Resolution Method (Q3721813) (← links)
• Algorithm Theory - SWAT 2004 (Q5315377) (← links)