Pages that link to "Item:Q3113677"
From MaRDI portal
The following pages link to Minimum \(s-t\) cut in undirected planar graphs when the source and the sink are close (Q3113677):
Displaying 6 items.
- Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time (Q764322) (← links)
- Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- On the Minimum Cut of Planarizations (Q3439582) (← links)
- (Q5743478) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)