An improved branch and bound algorithm for the maximum clique problem (Q2837833)
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 improved branch and bound algorithm for the maximum clique problem |
scientific article; zbMATH DE number 6184845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved branch and bound algorithm for the maximum clique problem |
scientific article; zbMATH DE number 6184845 |
Statements
5 July 2013
0 references
algorithm
0 references
finding a maximum clique
0 references
coloring algorithm
0 references
dynamically varying bounds
0 references
An improved branch and bound algorithm for the maximum clique problem (English)
0 references
0.9179874062538148
0 references
0.8829523921012878
0 references
0.8766153454780579
0 references
0.8761476874351501
0 references
