Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10732-012-9207-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10732-012-9207-5 / rank | |||
Normal rank | |||
Latest revision as of 04:52, 18 December 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
0 references
