A much faster branch-and-bound algorithm for finding a maximum clique (Q4632188)
From MaRDI portal
!
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 7048088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A much faster branch-and-bound algorithm for finding a maximum clique |
scientific article; zbMATH DE number 7048088 |
Statements
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (English)
0 references
26 April 2019
0 references
0 references
0.9471184015274048
0 references
0.8972154855728149
0 references
0.889091432094574
0 references
0.8757771253585815
0 references
