A simple and faster branch-and-bound algorithm for finding a maximum clique (Q3404446)
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: A simple and faster branch-and-bound algorithm for finding a maximum clique |
scientific article; zbMATH DE number 5667866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple and faster branch-and-bound algorithm for finding a maximum clique |
scientific article; zbMATH DE number 5667866 |
Statements
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (English)
0 references
9 February 2010
0 references
0.9471184015274048
0 references
0.8871655464172363
0 references
0.8837338089942932
0 references
0.8761476874351501
0 references
