Multi-threading a state-of-the-art maximum clique algorithm (Q1736587)
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: Multi-threading a state-of-the-art maximum clique algorithm |
scientific article; zbMATH DE number 7042181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multi-threading a state-of-the-art maximum clique algorithm |
scientific article; zbMATH DE number 7042181 |
Statements
Multi-threading a state-of-the-art maximum clique algorithm (English)
0 references
26 March 2019
0 references
Summary: We present a threaded parallel adaptation of a state-of-the-art maximum clique algorithm for dense, computationally challenging graphs. We show that near-linear speedups are achievable in practice and that superlinear speedups are common. We include results for several previously unsolved benchmark problems.
0 references
maximum clique
0 references
multi-core
0 references
parallel algorithms
0 references
parallel branch and bound
0 references
0 references
0.9237035
0 references
0.9040636
0 references
0.90058494
0 references
0.8990921
0 references
0.89660436
0 references
0.89521134
0 references
0.8912791
0 references
