Pages that link to "Item:Q2382669"
From MaRDI portal
The following pages link to On the bounded-hop MST problem on random Euclidean instances (Q2382669):
Displaying 3 items.
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
- Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
- On efficient connectivity-preserving transformations in a grid (Q5918321) (← links)
