The following pages link to (Q4840774):
Displaying 50 items.
- Judicious bisection of hypergraphs (Q287970) (← links)
- Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors (Q314769) (← links)
- On judicious bisections of graphs (Q402590) (← links)
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- Online maximum directed cut (Q454250) (← links)
- Solving the maxcut problem by the global equilibrium search (Q466339) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- Sequences of radius \(k\) for complete bipartite graphs (Q528554) (← links)
- Small bipartite subgraph polytopes (Q613319) (← links)
- A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- The real positive semidefinite completion problem for series-parallel graphs (Q676039) (← links)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- Partitioning 3-uniform hypergraphs (Q765201) (← links)
- Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) (Q830923) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- Maximum cut in fuzzy nature: models and algorithms (Q964947) (← links)
- The Laplacian spectral radius of a graph under perturbation (Q1005808) (← links)
- Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (Q1018104) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- The line index and minimum cut of weighted graphs (Q1303736) (← links)
- Maximum cut on line and total graphs (Q1304481) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs (Q1748508) (← links)
- Programming for modular reconfigurable robots (Q1758696) (← links)
- A study of the performance of classical minimizers in the quantum approximate optimization algorithm (Q2059592) (← links)
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015) (← links)
- Cuts in undirected graphs. I (Q2215599) (← links)
- Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} (Q2300620) (← links)
- Hypergraph cuts above the average (Q2327966) (← links)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- Approximation algorithms for maximum cut with limited unbalance (Q2456360) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- A counterexample to the dominating set conjecture (Q2458916) (← links)
- An exact algorithm for MAX-CUT in sparse graphs (Q2467485) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- A \(2^{|E|/4}\)-time algorithm for MAX-CUT (Q2577592) (← links)
- SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s (Q2741323) (← links)
- An effective compact formulation of the max cut problem on sparse graphs (Q2840693) (← links)
- Settling the Complexity of Local Max-Cut (Almost) Completely (Q3012803) (← links)
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance (Q3057151) (← links)
- Sequences of Radius k for Complete Bipartite Graphs (Q3181042) (← links)
- Bounds for the Laplacian spectral radius of graphs (Q5006624) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)
- MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems (Q6053474) (← links)
- Algorithm unions for solving discrete optimization problems (Q6066035) (← links)
