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 this page instead for the normal view: A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique |
scientific article; zbMATH DE number 7048088
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
