Parallel Algorithms for Finding Large Cliques in Sparse Graphs.
Lukas GianinazziMaciej BestaYannick SchaffnerTorsten HoeflerPublished in: SPAA (2021)
Keyphrases
- parallel algorithm
- maximum clique
- weighted graph
- maximal cliques
- parallel computation
- graph structure
- parallel programming
- branch and bound algorithm
- cluster of workstations
- shared memory
- pc cluster
- binary images
- graph theory
- parallel implementations
- combinatorial search problems
- data structure
- discovery of association rules
- association graph
- shortest path