Finding large cliques in sparse semi-random graphs by simple randomized search heuristics (Q2455599)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding large cliques in sparse semi-random graphs by simple randomized search heuristics |
scientific article |
Statements
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics (English)
0 references
25 October 2007
0 references
Maximum clique problem
0 references
semi-random graphs
0 references
randomized local search algorithms
0 references
evolutionary algorithms
0 references
population size
0 references
runtime analysis
0 references
