An algorithm for finding a maximum clique in a graph (Q1267190)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for finding a maximum clique in a graph |
scientific article; zbMATH DE number 1207139
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding a maximum clique in a graph |
scientific article; zbMATH DE number 1207139 |
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
0 references
