Multi-threading a state-of-the-art maximum clique algorithm (Q1736587)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multi-threading a state-of-the-art maximum clique algorithm |
scientific article |
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
