Pages that link to "Item:Q1897477"
From MaRDI portal
The following pages link to Optimal parallel algorithms for rectilinear link-distance problems (Q1897477):
Displaying 6 items.
- An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions (Q1025292) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- An optimal algorithm for the rectilinear link center of a rectilinear polygon (Q1917052) (← links)
- An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (Q4682194) (← links)
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel (Q5054772) (← links)
