Minimums-tCut of a Planar Undirected Network in O(n\log ^2 (n)) Time
From MaRDI portal
Publication:3967060
Cited in
(21)- Parallel nested dissection for path algebra computations
- Maximum weight independent set in trees
- The planar multiterminal cut problem
- Flow in planar graphs with vertex capacities
- Faster shortest paths in dense distance graphs, with applications
- Fast and efficient solution of path algebra problems
- Non-crossing shortest paths in undirected unweighted planar graphs in linear time
- Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
- Counting and sampling minimum cuts in genus g graphs
- A near-linear approximation scheme for multicuts of embedded graphs with a fixed number of terminals
- Global minimum cuts in surface embedded graphs
- Minimum Cuts in Surface Graphs
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- Non-crossing shortest paths lengths in planar graphs in linear time
- How vulnerable is an undirected planar graph with respect to max flow
- Non-crossing shortest paths lengths in planar graphs in linear time
- How vulnerable is an undirected planar graph with respect to max flow
- Nested dissection meets IPMs: planar min-cost flow in nearly-linear time
- Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time
- Flow equivalent trees in undirected node-edge-capacitated planar graphs
This page was built for publication: Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967060)
