Pages that link to "Item:Q5056133"
From MaRDI portal
The following pages link to Parallel algorithms for all minimum link paths and link center problems (Q5056133):
Displaying 4 items.
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel (Q5054772) (← links)
- An O(n log n) algorithm for computing a link center in a simple polygon (Q5096146) (← links)