Cuts in undirected graphs. II

DOI10.1007/S10559-020-00292-ZMaRDI QIDQ2215853zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 14 December 2020

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-020-00292-z

zbMATH Keywords

graphsconvex functionpolymatroidcutsspecial polyhedra

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Cuts in undirected graphs. I
• Finding the maximum cut by the greedy algorithm
• Minimum cut bases in undirected networks
• A new approach to the minimum cut problem
• scientific article; zbMATH DE number 1787231

Cites work

• scientific article; zbMATH DE number 3748742 (Why is no real title available?)
• Cuts in undirected graphs. I
• Finding the maximum cut by the greedy algorithm
• Minimizing symmetric submodular functions
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Submodular function minimization
• Submodular functions and optimization.

Cited in

(8)

• Combinatorial and geometric properties of the max-cut and min-cut problems
• Cuts in undirected graphs. I
• The problem of \(\Pi_{2}\)-cut-introduction
• Finding the maximum cut by the greedy algorithm
• A remark on max-cut problem with an application to digital-analogue convertors
• Odd Multiway Cut in Directed Acyclic Graphs
• Minimum cut bases in undirected networks
• Cuts, trees and \(\ell_1\)-embeddings of graphs

Describes a project that uses

Uses Software

• Biq Mac

This page was built for publication: Cuts in undirected graphs. II

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