Pages that link to "Item:Q603870"
From MaRDI portal
The following pages link to Computing the shortest essential cycle (Q603870):
Displaying 8 items.
- Splitting (complicated) surfaces is hard (Q934027) (← links)
- Optimal system of loops on an orientable surface (Q1773896) (← links)
- Discrete systolic inequalities and decompositions of triangulated surfaces (Q2349858) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- (Q5389994) (← links)
- (Q5743478) (← links)