On the max‐cut of sparse random graphs

E-ISSN： 1098-2418|52|2|219-262

ISSN： 1042-9832

Source： RANDOM STRUCTURES AND ALGORITHMS, Vol.52, Iss.2, 2018-03, pp. : 219-262

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Improved approximation of Max-Cut on graphs of bounded degree

By Feige U. Karpinski M. Langberg M.

Journal of Algorithms, Vol. 43, Iss. 2, 2002-05 ,pp. : 201-219

Academic Press

Access to resources Recommend Favorite

Partitioning planar graphs: a fast combinatorial approach for max-cut

By Liers F. Pardella G.

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 323-344

Springer Publishing Company

Access to resources Recommend Favorite

The Diameter of Sparse Random Graphs

By Chung F. Lu L.

Advances in Applied Mathematics, Vol. 26, Iss. 4, 2001-05 ,pp. : 257-279

Academic Press

Access to resources Recommend Favorite

Randomized Heuristics for the Max-Cut Problem

By Festa P. Pardalos P.M. Resende M.G.C. Ribeiro C.C.

Optimization Methods and Software, Vol. 17, Iss. 6, 2002-01 ,pp. : 1033-1058

Taylor & Francis Ltd

Access to resources Recommend Favorite

A 2^|E|/4-time algorithm for MAX-CUT

By Kulikov A. Fedin S.

Journal of Mathematical Sciences, Vol. 126, Iss. 3, 2005-03 ,pp. : 1200-1204

Springer Publishing Company

Access to resources Recommend Favorite