The following pages link to (Q4840774):
Displayed 27 items.
- 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)
- Partitioning 3-uniform hypergraphs (Q765201) (← 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)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← 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)
- (Q2741323) (← 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)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)