Cuts in undirected graphs. II

DOI10.1007/S10559-020-00292-ZzbMATH Open1454.90103OpenAlexW4235911878MaRDI QIDQ2215853FDOQ2215853

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

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

zbMATH Keywords

graphsconvex functionpolymatroidcutsspecial polyhedra

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Submodular functions and optimization.
• Minimizing symmetric submodular functions
• Title not available (Why is that?)
• Submodular function minimization
• Cuts in undirected graphs. I
• Finding the maximum cut by the greedy algorithm

Cited In (8)

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

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)