Pages that link to "Item:Q2931158"
From MaRDI portal
The following pages link to ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE (Q2931158):
Displaying 4 items.
- Shortest path problem in rectangular complexes of global nonpositive curvature (Q714903) (← links)
- CAT(0) is an algorithmic property (Q1768266) (← links)
- Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes (Q2664104) (← links)