Combinatorial and geometric properties of the Max-Cut and Min-Cut problems

Author： Bondarenko V.   Nikolaev A.  

Publisher： MAIK Nauka/Interperiodica

ISSN： 1064-5624

Source： Doklady Mathematics, Vol.88, Iss.2, 2013-09, pp. : 516-517

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

Related content

A fuzzy max-flow min-cut theorem

By Diamond P.  

Fuzzy Sets and Systems, Vol. 119, Iss. 1, 2001-04 ,pp. : 139-148

Elsevier

Access to resources Recommend Favorite

Fully-Dynamic Min-Cut*

By Thorup Mikkel  

Combinatorica, Vol. 27, Iss. 1, 2007-02 ,pp. : 91-127

Springer Publishing Company

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

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

On the max‐cut of sparse random graphs

By  

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

John Wiley & Sons Inc

Access to resources Recommend Favorite