Better bounds for Max Cut
From MaRDI portal
Recommendations
Cited in
(74)- Judicious \(k\)-partitions of graphs
- A remark on max-cut problem with an application to digital-analogue convertors
- Maximum cuts and judicious partitions in graphs without short cycles
- Note on maximal bisection above tight lower bound
- An improved kernel for max-bisection above tight lower bound
- Dense induced bipartite subgraphs in triangle-free graphs
- Maximum bipartite subgraphs in graphs without short cycles
- On judicious bipartitions of directed graphs
- Cuts in undirected graphs. II
- Maximum bisections of graphs without short even cycles
- Hypergraph cuts above the average
- On problems about judicious bipartitions of graphs
- On bisections of directed graphs
- Three conjectures in extremal spectral graph theory
- Large cuts with local algorithms on triangle-free graphs
- Inverting the Turán problem
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound
- The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
- An exact algorithm for MAX-CUT in sparse graphs
- A \(2^{|E|/4}\)-time algorithm for MAX-CUT
- Biased partitions and judicious \(k\)-partitions of graphs
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach
- Computing the largest bond and the maximum connected cut of a graph
- On judicious partitions of uniform hypergraphs
- Combinatorial approximation algorithms for the maximum directed cut problem
- On judicious partitions of graphs
- Sharpened lower bounds for cut elimination
- On a Conjecture of Erdős, Gallai, and Tuza
- Bounds for pairs in judicious partitioning of graphs
- The crossing number of the cone of a graph
- Cutting two graphs simultaneously
- On judicious bisections of graphs
- Upper bounds on minimum balanced bipartitions
- Linear-Time Approximation Algorithms for the Max Cut Problem
- On max cut in cubic graphs
- Judicious partitions of bounded‐degree graphs
- The crossing number of the cone of a graph
- A combinatorial design approach to MAXCUT
- Bisections of graphs without short cycles
- The Bollobás-Scott conjecture for 4-uniform hypergraphs
- Maximum cuts of graphs with forbidden cycles
- A bound for judicious k-partitions of graphs
- scientific article; zbMATH DE number 780784 (Why is no real title available?)
- Judicious partitions of uniform hypergraphs
- MAX-CUT has a randomized approximation scheme in dense graphs
- A combinatorial design approach to MAXCUT
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound
- Maximum cuts in graphs without wheels
- Bipartite subgraphs of H-free graphs
- On a problem of judicious k-partitions of graphs
- Lower bounds for max-cut in H-free graphs via semidefinite programming
- Max CUT and the smallest eigenvalue
- Maximizing Several Cuts Simultaneously
- MaxCut in ${\bm H)$-Free Graphs
- Maximum bipartite subgraphs in H-free graphs
- On judicious bipartitions of graphs
- Improving the integrality gap for multiway cut
- Improving the integrality gap for multiway cut
- On several partitioning problems of Bollobás and Scott
- Making an H H‐free graph k k‐colorable
- Lower Bounds for Maximum Weighted Cut
- Graph partitioning: an updated survey
- Approximating long cycle above Dirac's guarantee
- Bounds on maximum weight directed cut
- Maximum bisections of graphs with girth at least six
- Maximum bisections of graphs without cycles of length four and five
- On Tuza's conjecture in dense graphs
- Bisections of directed graphs without complete bipartite subgraphs
- A note on balanced bipartitions
- Linear kernels and linear-time algorithms for finding large cuts
- On maximum bisections of \(\{C_4, \theta (2, 3, 3)\}\)-free graphs
- MaxCut in graphs with sparse neighborhoods
- Making a K₄-free graph bipartite
- Max \(k\)-cut and judicious \(k\)-partitions
This page was built for publication: Better bounds for Max Cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4550236)
