Pages that link to "Item:Q934027"
From MaRDI portal
The following pages link to Splitting (complicated) surfaces is hard (Q934027):
Displaying 12 items.
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- Computing the shortest essential cycle (Q603870) (← links)
- Non total-unimodularity neutralized simplicial complexes (Q1707913) (← links)
- Topologically trivial closed walks in directed surface graphs (Q2223623) (← links)
- Computing intersection numbers and bases of cohomology groups for triangulated closed three-dimensional manifolds (Q2319694) (← links)
- Discrete systolic inequalities and decompositions of triangulated surfaces (Q2349858) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- Irreducible triangulations of surfaces with boundary (Q2637719) (← links)
- (Q5088964) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- (Q5743478) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
