A parallel maximum clique algorithm for large and massive sparse graphs
From MaRDI portal
Publication:526419
DOI10.1007/S11590-016-1019-3zbMATH Open1370.90227OpenAlexW2291939239MaRDI QIDQ526419FDOQ526419
Authors: Pablo San Segundo, Alvaro Lopez, Jorge Artieda, Panos M. Pardalos 
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
Recommendations
- Parallel maximum clique algorithms with applications to network analysis
- A new exact maximum clique algorithm for large and massive sparse graphs
- scientific article; zbMATH DE number 4072403
- Fast algorithms for the maximum clique problem on massive sparse graphs
- A parallel implementation for the maximum clique problem
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network
- scientific article; zbMATH DE number 1424217
- scientific article; zbMATH DE number 1728440
- A linear time algorithm for maximal clique enumeration in large sparse graphs
- Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
Cites Work
- Relaxed approximate coloring in exact maximum clique search
- An improved branch and bound algorithm for the maximum clique problem
- Algorithm 457: finding all cliques of an undirected graph
- Reducibility among combinatorial problems
- A fast algorithm for the maximum clique problem
- An exact bit-parallel algorithm for the maximum clique problem
- Finding a Maximum Clique in an Arbitrary Graph
- Multi-threading a state-of-the-art maximum clique algorithm
- A review on algorithms for maximum clique problems
- An exact algorithm for the maximum clique problem
- On chromatic number of graphs and set-systems
- Title not available (Why is that?)
- Exact algorithms for maximum clique: a computational study
- An improved bit parallel exact maximum clique algorithm
- Fast algorithms for the maximum clique problem on massive sparse graphs
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Infra-chromatic bound for exact maximum clique search
- Fast algorithms for determining (generalized) core groups in social networks
- A parallel branch and bound algorithm for the maximum labelled clique problem
- Title not available (Why is that?)
Cited In (15)
- Title not available (Why is that?)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Parallel maximum clique algorithms with applications to network analysis
- Massively Parallel Correlation Clustering in Bounded Arboricity Graphs
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs
- A new exact maximum clique algorithm for large and massive sparse graphs
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network
- Multi-threading a state-of-the-art maximum clique algorithm
- Why is maximum clique often easy in practice?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel community detection for massive graphs
- Fast algorithms for the maximum clique problem on massive sparse graphs
- An improved bit parallel exact maximum clique algorithm
Uses Software
This page was built for publication: A parallel maximum clique algorithm for large and massive sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526419)
