Pages that link to "Item:Q3595495"
From MaRDI portal
The following pages link to Computing Geometric Minimum-Dilation Graphs Is NP-Hard (Q3595495):
Displaying 8 items.
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- Minimum weight Euclidean \(t\)-spanner is NP-hard (Q396666) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- Computing a minimum-dilation spanning tree is NP-hard (Q945943) (← links)
- Optimal Embedding into Star Metrics (Q3183463) (← links)
- Computing Minimum Dilation Spanning Trees in Geometric Graphs (Q3196394) (← links)
- DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (Q5305064) (← links)
