Cuts in undirected graphs. II

DOI10.1007/s10559-020-00292-zzbMath1454.90103OpenAlexW4235911878MaRDI QIDQ2215853

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

convex functiongraphspolymatroidcutsspecial polyhedra

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Uses Software

• Biq Mac

Cites Work

• Unnamed Item
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Submodular function minimization
• Minimizing symmetric submodular functions
• Finding the maximum cut by the greedy algorithm
• Cuts in undirected graphs. I
• Submodular functions and optimization.
• The Matching Polytope has Exponential Extension Complexity