Pages that link to "Item:Q714903"
From MaRDI portal
The following pages link to Shortest path problem in rectangular complexes of global nonpositive curvature (Q714903):
Displaying 13 items.
- Geodesics in CAT(0) cubical complexes (Q651054) (← links)
- Length minimizing paths in the hyperbolic plane: proof via paired subcalibrations (Q938616) (← links)
- Minimum path problems in normed spaces: Reflection and refraction (Q1579628) (← links)
- CAT(0) is an algorithmic property (Q1768266) (← links)
- Graphs of some CAT(0) complexes (Q1973869) (← links)
- Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
- Distance and routing labeling schemes for cube-free median graphs (Q2223698) (← links)
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes (Q2664104) (← links)
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE (Q2931158) (← links)
- Weakly Modular Graphs and Nonpositive Curvature (Q3380549) (← links)
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes (Q5002757) (← links)
- Old and new challenges in Hadamard spaces (Q6052560) (← links)
- Sample Compression Schemes for Balls in Graphs (Q6069434) (← links)