Author： Fan Neng
Publisher： Springer Publishing Company
ISSN： 1382-6905
Source： Journal of Combinatorial Optimization, Vol.23, Iss.2, 2012-02, pp. : 224-251
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A Simple Algorithm for the Planar Multiway Cut Problem
By Yeh W-C.
Journal of Algorithms, Vol. 39, Iss. 1, 2001-04 ,pp. :
Access to resources
Recommend
The Least Eigenvalue of Graphs with Cut Edges
By Wang Yi
Graphs and Combinatorics, Vol. 28, Iss. 4, 2012-07 ,pp. :
On the max‐cut of sparse random graphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 52, Iss. 2, 2018-03 ,pp. :
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. :