Pages that link to "Item:Q3418207"
From MaRDI portal
The following pages link to Solving minimum K-cardinality cut problems in planar graphs (Q3418207):
Displaying 6 items.
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
- Efficient algorithms for \(k\)-terminal cuts on planar graphs (Q1889599) (← links)
- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time (Q2843281) (← links)
- An optimal algorithm for the minimum edge cardinality cut surface problem (Q5361640) (← links)
- (Q5501344) (← links)
