A parallel maximum clique algorithm for large and massive sparse graphs
From MaRDI portal
Publication:526419
DOI10.1007/s11590-016-1019-3zbMath1370.90227OpenAlexW2291939239MaRDI QIDQ526419
Álvaro G. López, Panos M. Pardalos, Jorge Artieda, Pablo San Segundo
Publication date: 12 May 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1019-3
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infra-chromatic bound for exact maximum clique search
- An exact bit-parallel algorithm for the maximum clique problem
- An exact algorithm for the maximum clique problem
- A fast algorithm for the maximum clique problem
- Exact algorithms for maximum clique: a computational study
- Multi-threading a state-of-the-art maximum clique algorithm
- An improved bit parallel exact maximum clique algorithm
- Relaxed approximate coloring in exact maximum clique search
- A parallel branch and bound algorithm for the maximum labelled clique problem
- Fast algorithms for determining (generalized) core groups in social networks
- A review on algorithms for maximum clique problems
- Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
- A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
- Finding a Maximum Clique in an Arbitrary Graph
- Reducibility among Combinatorial Problems
- On chromatic number of graphs and set-systems
- Algorithm 457: finding all cliques of an undirected graph
This page was built for publication: A parallel maximum clique algorithm for large and massive sparse graphs
