Combinatorial and geometric properties of the max-cut and min-cut problems
From MaRDI portal
Publication:393848
DOI10.1134/S1064562413050062zbMath1291.90198OpenAlexW2067818563MaRDI QIDQ393848
V. A. Bondarenko, Andrei Nikolaev
Publication date: 24 January 2014
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562413050062
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Flows in graphs (05C21)
Related Items (3)
Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes ⋮ Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search ⋮ On graphs of the cone decompositions for the min-cut and max-cut problems
Cites Work
This page was built for publication: Combinatorial and geometric properties of the max-cut and min-cut problems
