Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Author:
- Tobias StorchTSTobias Storch
- 1 October 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 386 (1-2) , 114-131
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion2006
- On the Choice of the Population Size2004
- Approximating Maximum Clique by Removing SubgraphsSIAM Journal on Discrete Mathematics, 2004
- On the analysis of the (1+1) evolutionary algorithmTheoretical Computer Science, 2002
- Heuristics for Semirandom Graph ProblemsJournal of Computer and System Sciences, 2001
- Finding and certifying a large hidden clique in a semirandom graphRandom Structures & Algorithms, 2000
- Algorithmic theory of random graphsRandom Structures & Algorithms, 1997
- Coloring Random and Semi-Random k-Colorable GraphsJournal of Algorithms, 1995
- Large Cliques Elude the Metropolis ProcessRandom Structures & Algorithms, 1992
- Reducibility among Combinatorial Problems1972