Pages that link to "Item:Q2664104"
From MaRDI portal
The following pages link to A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes (Q2664104):
Displaying 5 items.
- Geodesics in CAT(0) cubical complexes (Q651054) (← links)
- Shortest path problem in rectangular complexes of global nonpositive curvature (Q714903) (← links)
- Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
- A nonpositive curvature property of modular semilattices (Q2230980) (← links)
- Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces (Q4959125) (← links)