Solving minimum K-cardinality cut problems in planar graphs

DOI10.1002/NET.20129zbMATH Open1148.90344OpenAlexW4253415821MaRDI QIDQ3418207FDOQ3418207

Authors: Maurizio Bruglieri, Francesco Maffioli, Marco Trubian 

Publication date: 2 February 2007

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20129

Recommendations

• Cardinality constrained minimum cut problems: complexity and algorithms.
• Partitioning planar graphs: a fast combinatorial approach for max-cut
• A Polynomial Algorithm for the k-cut Problem for Fixed k
• An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem
• The planar multiterminal cut problem

zbMATH Keywords

semidefinite programmingplanar graphscut problemsLagrangian relaxationexact perfect matchingminimum \(k\)-cardinality cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Systems of distinct representatives and linear algebra

Cited In (6)

• Efficient algorithms for \(k\)-terminal cuts on planar graphs
• Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
• Partitioning planar graphs: a fast combinatorial approach for max-cut
• Title not available (Why is that?)
• Cardinality constrained minimum cut problems: complexity and algorithms.
• An optimal algorithm for the minimum edge cardinality cut surface problem

Uses Software

• CSDP

This page was built for publication: Solving minimum K-cardinality cut problems in planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418207)