Finding maximum cliques in arbitrary and in special graphs (Q807639): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02257777 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1512959368 / rank | |||
Normal rank | |||
Latest revision as of 08:28, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding maximum cliques in arbitrary and in special graphs |
scientific article |
Statements
Finding maximum cliques in arbitrary and in special graphs (English)
0 references
1991
0 references
maximum clique problem
0 references
polynomial solvable problems
0 references
branch and bound algorithm
0 references
0 references
0 references
0 references
