A parallel maximum clique algorithm for large and massive sparse graphs (Q526419)
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 parallel maximum clique algorithm for large and massive sparse graphs |
scientific article; zbMATH DE number 6715254
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel maximum clique algorithm for large and massive sparse graphs |
scientific article; zbMATH DE number 6715254 |
Statements
A parallel maximum clique algorithm for large and massive sparse graphs (English)
0 references
12 May 2017
0 references
massive
0 references
bitstring
0 references
branch-and-bound
0 references
maximum clique
0 references
parallel
0 references
combinatorial optimization
0 references
0.95153415
0 references
0.9506476
0 references
0.9482156
0 references
0.9411752
0 references
0.9259947
0 references
