Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10732-012-9207-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2036313802 / rank | |||
Normal rank | |||
Revision as of 01:31, 20 March 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
