Pages that link to "Item:Q945943"
From MaRDI portal
The following pages link to Computing a minimum-dilation spanning tree is NP-hard (Q945943):
Displayed 6 items.
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- Optimal Embedding into Star Metrics (Q3183463) (← links)
- COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (Q3562852) (← links)
- DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (Q5305064) (← links)