Cuts in undirected graphs. I
From MaRDI portal
Publication:2215599
DOI10.1007/s10559-020-00272-3zbMath1472.05043OpenAlexW3045812821MaRDI QIDQ2215599
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-00272-3
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (1)
Uses Software
Cites Work
- The max-cut problem on graphs not contractible to \(K_ 5\)
- Pseudo-Boolean optimization
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Submodular function minimization
- Weakly bipartite graphs and the max-cut problem
- Some simplified NP-complete graph problems
- Finding the maximum cut by the greedy algorithm
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A simple min-cut algorithm
- Reducibility among Combinatorial Problems
- Unifying maximum cut and minimum cut of a planar graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Cuts in undirected graphs. I
