The following pages link to (Q5743478):
Displaying 6 items.
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← 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)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← 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)