An algorithm for finding a maximum clique in a graph (Q1267190): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GAP / rank | |||
Normal rank | |||
Revision as of 10:31, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding a maximum clique in a graph |
scientific article |
Statements
An algorithm for finding a maximum clique in a graph (English)
0 references
6 October 1998
0 references
graph algorithm
0 references
maximum clique problem
0 references
branch-and-bound algorithm
0 references
vertex coloring
0 references
fractional coloring
0 references
