Pages that link to "Item:Q2294682"
From MaRDI portal
The following pages link to Time-space trade-offs for computing Euclidean minimum spanning trees (Q2294682):
Displaying 8 items.
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- Time-space trade-offs for computing Euclidean minimum spanning trees (Q2294682) (← links)
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms (Q2415364) (← links)
- (Q3387271) (redirect page) (← links)
- Testing Euclidean minimum spanning trees in the plane (Q4962736) (← links)
- Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time (Q5700570) (← links)