Parallel maximum clique algorithms with applications to network analysis
From MaRDI portal
Recommendations
- A parallel maximum clique algorithm for large and massive sparse graphs
- Fast algorithms for the maximum clique problem on massive sparse graphs
- A new exact maximum clique algorithm for large and massive sparse graphs
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Enumerating maximal cliques in large sparse graphs
Cites work
- A fast algorithm for the maximum clique problem
- Algorithm 457: finding all cliques of an undirected graph
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact bit-parallel algorithm for the maximum clique problem
- An improved branch and bound algorithm for the maximum clique problem
- Benchmarking optimization software with performance profiles.
- Codes for the World Wide Web
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- Components in time-varying graphs
- Exact algorithms for maximum clique: a computational study
- Fast algorithms for determining (generalized) core groups in social networks
- Fast algorithms for the maximum clique problem on massive sparse graphs
- scientific article; zbMATH DE number 1670532 (Why is no real title available?)
- scientific article; zbMATH DE number 1003288 (Why is no real title available?)
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 956839 (Why is no real title available?)
- Listing all maximal cliques in large sparse real-world graphs
- Listing all maximal cliques in sparse graphs in near-optimal time
- Multi-threading a state-of-the-art maximum clique algorithm
- On chromatic number of graphs and set-systems
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network
- Speeding up algorithms on compressed web graphs
- The maximum clique problem
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model
- What's in a crowd? Analysis of face-to-face behavioral networks
- Über eine von H. S. WILF angegebene Schranke für die chromatische Zahl endlicher Graphen
Cited in
(23)- Multi-threading a state-of-the-art maximum clique algorithm
- Maximal strongly connected cliques in directed graphs: algorithms and bounds
- Worst-case analysis of clique MIPs
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- A maximum clique based approximation algorithm for wireless link scheduling under SINR model
- scientific article; zbMATH DE number 1728440 (Why is no real title available?)
- Clique counting in MapReduce: algorithms and experiments
- Finding top-N colossal patterns based on clique search with dynamic update of graph
- Fast algorithms for the maximum clique problem on massive sparse graphs
- External-memory network analysis algorithms for naturally sparse graphs
- scientific article; zbMATH DE number 5669599 (Why is no real title available?)
- Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network
- PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS
- Exhaustive community enumeration in parallel
- scientific article; zbMATH DE number 1424217 (Why is no real title available?)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Finding cliques in social networks: a new distribution-free model
- Why is maximum clique often easy in practice?
- A parallel maximum clique algorithm for large and massive sparse graphs
- Parallel community detection for massive graphs
- Solving larger maximum clique problems using parallel quantum annealing
- Learning to sample initial solution for solving 0-1 discrete optimization problem by local search
Describes a project that uses
Uses Software
This page was built for publication: Parallel maximum clique algorithms with applications to network analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3447472)
