An improved bit parallel exact maximum clique algorithm (Q1941191)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6143311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved bit parallel exact maximum clique algorithm |
scientific article; zbMATH DE number 6143311 |
Statements
An improved bit parallel exact maximum clique algorithm (English)
0 references
12 March 2013
0 references
maximum clique
0 references
branch and bound
0 references
exact search
0 references
graph
0 references
0.9100725054740906
0 references
0.8549361824989319
0 references
0.8402678966522217
0 references
0.8247542381286621
0 references
0.8195520043373108
0 references
