A Continuation Algorithm for Max-Cut Problem

E-ISSN： 1439-7617|23|7|1257-1264

ISSN： 1439-8516

Source： Acta Mathematica Sinica, Vol.23, Iss.7, 2007-07, pp. : 1257-1264

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 Simple and Fast Min-Cut Algorithm

By Brinkmeier Michael

Theory of Computing Systems, Vol. 41, Iss. 2, 2007-08 ,pp. : 369-380

Springer Publishing Company

Access to resources Recommend Favorite

An algorithm for constructing locally optimal min-max triangulation

Bulletin of the Australian Mathematical Society, Vol. 54, Iss. 1, 1996-08 ,pp. : 167-176

Cambridge University Press

Access to resources Recommend Favorite

Numerical solution of the Monge–Kantorovich problem by density lift-up continuation

By Bouharguane Afaf Iollo Angelo Weynans Lisl

ESAIM: Mathematical Modelling and Numerical Analysis, Vol. 49, Iss. 6, 2015-11 ,pp. : 1577-1592

Edp Sciences

Access to resources Recommend Favorite

The maximum cut problem on blow-ups of multiprojective spaces

By Junca Mauricio Velasco Mauricio

Journal of Algebraic Combinatorics, Vol. 38, Iss. 4, 2013-12 ,pp. : 797-827

Springer Publishing Company

Access to resources Recommend Favorite

Cut time in sub-riemannian problem on engel group∗

By Ardentov A.A. Sachkov Yu.L.

ESAIM: Control, Optimisation and Calculus of Variations, Vol. 21, Iss. 4, 2015-07 ,pp. : 958-988

Edp Sciences

Access to resources Recommend Favorite