Pages that link to "Item:Q3677185"

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

Displaying 4 items.

• 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)
• The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)