Pages that link to "Item:Q911288"
From MaRDI portal
The following pages link to Computing Euclidean maximum spanning trees (Q911288):
Displaying 11 items.
- On the longest spanning tree with neighborhoods (Q777263) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
- Transitions in geometric minimum spanning trees (Q1199130) (← links)
- On minimum and maximum spanning trees of linearly moving points (Q1346135) (← links)
- Geometric clustering in normed planes (Q1631777) (← links)
- Spanning trees in multipartite geometric graphs (Q1755734) (← links)
- Average case analysis of dynamic geometric optimization (Q1917043) (← links)
- Maximum spanning trees in normed planes (Q2042214) (← links)
- Maximum plane trees in multipartite geometric graphs (Q5915987) (← links)
- Piercing diametral disks induced by edges of maximum spanning trees (Q6636995) (← links)
