Subgraph extraction and metaheuristics for the maximum clique problem
- 30 August 2012
- journal article
- Published by Springer Nature in Journal of Heuristics
- Vol. 18 (5) , 767-794
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Simple ingredients leading to very efficient heuristics for the maximum clique problemJournal of Heuristics, 2007
- A new trust region technique for the maximum weight clique problemDiscrete Applied Mathematics, 2006
- Variable neighborhood search for the maximum cliqueDiscrete Applied Mathematics, 2004
- Reactive Local Search for the Maximum Clique Problem1Algorithmica, 2001
- Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique ProblemsJournal of Heuristics, 1998
- AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc GraphsJournal of Algorithms, 1997
- Test case generators and computational results for the maximum clique problemJournal of Global Optimization, 1993
- An exact algorithm for the maximum clique problemOperations Research Letters, 1990
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986
- Error Detecting and Error Correcting CodesBell System Technical Journal, 1950