A parallel maximum clique algorithm for large and massive sparse graphs (Q526419): Difference between revisions
From MaRDI portal
Latest revision as of 20:03, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A parallel maximum clique algorithm for large and massive sparse graphs |
scientific article |
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