On max cut in cubic graphs

ISSN： 1063-7192

Source： Parallel Algorithms and Applications, Vol.17, Iss.3, 2001-01, pp. : 165-183

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

Lagrangian Smoothing Heuristics for Max-Cut

By Alperin Hernán Nowak Ivo

Journal of Heuristics, Vol. 11, Iss. 5-6, 2005-12 ,pp. : 447-463

Springer Publishing Company

Access to resources Recommend Favorite

On greedy construction heuristics for the MAX-CUT problem

By Kahruman Sera Kolotoglu Elif Butenko Sergiy Hicks Illya V.

International Journal of Computational Science and Engineering, Vol. 3, Iss. 3, 2008-04 ,pp. : 211-218

Inderscience Publishers

Access to resources Recommend Favorite

A Randomized Approximation Scheme for Metric MAX-CUT

By Fernandez de la Vega W. Kenyon C.

Journal of Computer and System Sciences, Vol. 63, Iss. 4, 2001-12 ,pp. : 531-541

Academic Press

Access to resources Recommend Favorite

Some APX-completeness results for cubic graphs

By Alimonti P. Kann V.

Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. : 123-134

Elsevier

Access to resources Recommend Favorite

The Complexity of Finding a Second Hamiltonian Cycle in Cubic Graphs

By Krawczyk A.

Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. : 641-647

Academic Press

Access to resources Recommend Favorite