The following pages link to (Q5501344):
Displaying 22 items.
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time (Q764322) (← links)
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs (Q1670994) (← links)
- Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
- Efficient algorithms for \(k\)-terminal cuts on planar graphs (Q1889599) (← links)
- Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320) (← links)
- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time (Q2843281) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- Minimum \(s-t\) cut in undirected planar graphs when the source and the sink are close (Q3113677) (← links)
- (Q3212283) (← links)
- Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time (Q3586078) (← links)
- An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem (Q3689216) (← links)
- (Q4607913) (← links)
- A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs (Q4899245) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- An optimal algorithm for the minimum edge cardinality cut surface problem (Q5361640) (← links)
- Structured recursive separator decompositions for planar graphs in linear time (Q5495821) (← links)
- (Q5743478) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
