Phased local search for the maximum clique problem

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.12, Iss.3, 2006-11, pp. : 303-323

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

On maximum degree‐based $γ$ ‐quasi‐clique problem: Complexity and exact approaches

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 71, Iss. 2, 2018-03 ,pp. : 136-152

John Wiley & Sons Inc

Access to resources Recommend Favorite

A local search heuristic for the Multi-Commodity [TEX equation: k] -splittable Maximum Flow Problem

By Gamst M.

Optimization Letters, Vol. 8, Iss. 3, 2014-03 ,pp. : 919-937

Springer Publishing Company

Access to resources Recommend Favorite

An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs

By Bhattacharya B.K. Kaller D.

Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. : 336-358

Academic Press

Access to resources Recommend Favorite

Local approximations for maximum partial subgraph problem

By Monnot J. Paschos V.T. Toulouse S.

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 217-224

Elsevier

Access to resources Recommend Favorite

Local Clique Covering of Claw‐Free Graphs

JOURNAL OF GRAPH THEORY, Vol. 81, Iss. 1, 2016-01 ,pp. : 92-104

John Wiley & Sons Inc

Access to resources Recommend Favorite