zbMath0834.05001MaRDI QIDQ4840774
Zsolt Tuza, Svatopluk Poljak
Publication date: 31 March 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\),
Judicious bisection of hypergraphs,
Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs,
Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors,
Sequences of Radius k for Complete Bipartite Graphs,
Semidefinite programming in combinatorial optimization,
Cuts, matrix completions and graph rigidity,
Unnamed Item,
Large cuts with local algorithms on triangle-free graphs,
Small bipartite subgraph polytopes,
A new upper bound for Max-2-SAT: A graph-theoretic approach,
MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems,
On judicious bisections of graphs,
Algorithm unions for solving discrete optimization problems,
Lifting and separation procedures for the cut polytope,
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem,
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.,
Online maximum directed cut,
Cuts in undirected graphs. I,
Solving the maxcut problem by the global equilibrium search,
Approximation algorithms for maximum cut with limited unbalance,
Approximating the fixed linear crossing number,
A counterexample to the dominating set conjecture,
\textsc{Max-Cut} parameterized above the Edwards-Erdős bound,
The real positive semidefinite completion problem for series-parallel graphs,
An exact algorithm for MAX-CUT in sparse graphs,
Settling the Complexity of Local Max-Cut (Almost) Completely,
A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs,
Sequences of radius \(k\) for complete bipartite graphs,
A survey of automated conjectures in spectral graph theory,
Programming for modular reconfigurable robots,
Maximum cut in fuzzy nature: models and algorithms,
Semidefinite programming and combinatorial optimization,
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance,
Linear kernels and linear-time algorithms for finding large cuts,
A semidefinite programming based polyhedral cut and price approach for the maxcut problem,
The Laplacian spectral radius of a graph under perturbation,
Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree},
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3,
A study of the performance of classical minimizers in the quantum approximate optimization algorithm,
Partitioning 3-uniform hypergraphs,
An effective compact formulation of the max cut problem on sparse graphs,
Solving quadratic (0,1)-problems by semidefinite programs and cutting planes,
Hypergraph cuts above the average,
Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality,
Bounds for the Laplacian spectral radius of graphs,
The line index and minimum cut of weighted graphs,
Maximum cut on line and total graphs,
A \(2^{|E|/4}\)-time algorithm for MAX-CUT,
Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
