The following pages link to Minimum Cuts in Surface Graphs (Q5885599):
Displaying 6 items.
- A minimal surface criterion for graph partitioning (Q338611) (← links)
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs (Q3132856) (← links)
- Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs (Q5056419) (← links)
- Holiest minimum-cost paths and flows in surface graphs (Q5230385) (← links)
- An optimal algorithm for the minimum edge cardinality cut surface problem (Q5361640) (← links)