Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:31, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subgraph extraction and metaheuristics for the maximum clique problem |
scientific article |
Statements
Subgraph extraction and metaheuristics for the maximum clique problem (English)
0 references
27 June 2017
0 references
maximum clique problem
0 references
triangulated graph
0 references
circular-arc graph
0 references
genetic algorithm
0 references
iterated local search
0 references
metaheuristics
0 references
