The following pages link to Homology Flows, Cohomology Cuts (Q4910577):
Displayed 8 items.
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- Topologically trivial closed walks in directed surface graphs (Q2223623) (← links)
- Discrete systolic inequalities and decompositions of triangulated surfaces (Q2349858) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- Computational topology and the Unique Games Conjecture (Q5115811) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)