Finding the maximum clique in massive graphs

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Proceedings of the VLDB Endowment

• Publication date

  2017-08-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.14778/3137628.3137660
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Diversified top-k clique search

  2015cited by this paper
• Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling

  2015cited by this paper
• Fast maximum clique algorithms for large graphs

  2014influential reference
• What is Twitter

  2013cited by this paper
• Redundancy-aware maximal cliques

  2013cited by this paper
• Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees

  2013cited by this paper
• Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction

  2013cited by this paper
• Fast algorithms for maximal clique enumeration with limited memory

  2012cited by this paper
• Truss Decomposition in Massive Networks

  2012cited by this paper
• Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs

  2012influential reference
• Community detection in Social Media

  2012cited by this paper
• Dynamic Local Search for the Maximum Clique Problem

  2011cited by this paper
• Large cliques in Arabidopsis gene coexpression network and motif discovery.

  2011cited by this paper
• A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique

  2010cited by this paper
• Finding maximal cliques in massive networks by H*-graph

  2010cited by this paper
• What is Twitter, a social network or a news media?

  2010cited by this paper
• Finding a team of experts in social networks

  2009cited by this paper
• Greedy Randomized Adaptive Search Procedures

  2009cited by this paper
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments

  2009influential reference
• An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments

  2007influential reference
• An improved branch and bound algorithm for the maximum clique problem

  2007cited by this paper
• Random graphs

  2006cited by this paper
• Coherent closed quasi-clique discovery from large dense graph databases

  2006cited by this paper
• Unsupervised Anomaly Detection in Network Intrusion Detection Using Clusters

  2005cited by this paper
• Approximating Maximum Clique by Removing Subgraphs

  2005cited by this paper
• Discovering Large Dense Subgraphs in Massive Graphs

  2005cited by this paper
• Network motifs in integrated cellular networks of transcription-regulation and protein-protein interaction.

  2004cited by this paper
• Cliquer user's guide, version 1.0

  2003cited by this paper
• An O(m) Algorithm for Cores Decomposition of Networks

  2003cited by this paper
• Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique

  2002cited by this paper
• Massive Quasi-Clique Detection

  2002cited by this paper
• A fast algorithm for the maximum clique problem

  2002cited by this paper
• Enumerating all connected maximal common subgraphs in two graphs

  2001cited by this paper
• Emergence of scaling in random networks

  1999cited by this paper
• Emergence of Scaling in Random Networks

  1999cited by this paper
• Clique is hard to approximate withinn1−ε

  1999cited by this paper
• Collective dynamics of ‘small-world’ networks

  1998cited by this paper
• Clique is hard to approximate within n1-epsilon

  1996cited by this paper
• A Critical Point for Random Graphs with a Given Degree Sequence

  1995cited by this paper
• Large Cliques Elude the Metropolis Process

  1992cited by this paper
• A Neural Network Model for Finding a Near-Maximum Clique

  1992cited by this paper
• Approximating clique is almost NP-complete

  1991cited by this paper
• An exact algorithm for the maximum clique problem

  1990influential reference
• Network structure and minimum degree

  1983cited by this paper
• Finding a Maximum Independent Set

  1976cited by this paper
• Algorithm 457: finding all cliques of an undirected graph

  1973cited by this paper
• The Enumeration of Maximal Cliques of Large Graphs

  1973cited by this paper
• Approximation algorithms for combinatorial problems

  1973cited by this paper
• Reducibility Among Combinatorial Problems

  1972cited by this paper
• The complexity of theorem-proving procedures

  1971cited by this paper
• A method of matrix analysis of group structure

  1949cited by this paper

• S$^3$GND: An Effective Learning-Based Approach for Subgraph Similarity Search Under Generalized Neighbor Difference Semantics (Technical Report)

  2026influential citation
• A greedy approach to solve maximum independent set problem: Differential Malatya independent set algorithm

  2025cites this paper
• Graph Data Model and Graph Query Language Based on the Monadic Second-Order Logic

  2025cites this paper
• Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space

  2025cites this paper
• General Randić and general sum connectivity indices of the conjugacy class graph

  2025cites this paper
• Clique Number Estimation via Differentiable Functions of Adjacency Matrix Permutations

  2025cites this paper
• Positive Communities on Signed Graphs That Are Not Echo Chambers: A Clique-Based Approach

  2024cites this paper
• Most Similar Biclique Search at Scale

  2024cites this paper
• Leveraging Imperfect-Orthogonality Aware Scheduling for High Scalability in LPWAN

  2024cites this paper
• Maximum k-Plex Computation: Theory and Practice

  2024cites this paper
• Maximal Quasi-Cliques Mining in Uncertain Graphs

  2023cites this paper
• Efficient k-Clique Listing: An Edge-Oriented Branching Strategy

  2023cites this paper
• Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs

  2023cites this paper
• Parallel Core Maintenance of Dynamic Graphs

  2023cites this paper
• Computing Significant Cliques in Large Labeled Networks

  2023cites this paper
• Core Decomposition on Uncertain Graphs Revisited

  2023cites this paper
• Balanced Clique Computation in Signed Networks: Concepts and Algorithms

  2022influential citation
• On fast enumeration of maximal cliques in large graphs

  2022cites this paper
• An Efficient Local Search for the Maximum Clique Problem on Massive Graphs

  2022cites this paper
• Fast Semantic-Assisted Outlier Removal for Large-scale Point Cloud Registration

  2022cites this paper
• Maximum and top-k diversified biclique search at scale

  2022cites this paper
• One Set to Cover All Maximal Cliques Approximately

  2022cites this paper
• Maximal Directed Quasi -Clique Mining

  2022cites this paper
• Discovering Cohesive Temporal Subgraphs with Temporal Density Aware Exploration

  2022cites this paper
• DecoMine: A Compilation-Based Graph Pattern Mining System with Pattern Decomposition

  2022cites this paper
• X-MAC: Achieving High Scalability via Imperfect-Orthogonality Aware Scheduling in LPWAN

  2022cites this paper
• Efficient Maximum k-Plex Computation over Large Sparse Graphs

  2022cites this paper
• Mining Stable Quasi-Cliques on Temporal Networks

  2021cites this paper
• Finding a Summary for All Maximal Cliques

  2021cites this paper
• Making graphs compact by lossless contraction

  2021influential citation
• Maximum Signed <inline-formula><tex-math notation="LaTeX">$\theta$</tex-math><alternatives><mml:math><mml:mi>θ</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq1-3098423.gif"/></alternatives></inline-formula>-Clique Identification in Large Signed Graphs

  2021cites this paper
• Generalized core maintenance of dynamic bipartite graphs

  2021cites this paper
• Maximal Clique Based Non-Autoregressive Open Information Extraction

  2021cites this paper
• Parallel mining of large maximal quasi-cliques

  2021cites this paper
• cliquematch: Finding correspondence via cliques in large graphs

  2021cites this paper
• Unsupervised Feature Selection for Efficient Exploration of High Dimensional Data

  2021cites this paper
• Maximum biclique search at billion scale

  2020cites this paper
• Learning fine-grained search space pruning and heuristics for combinatorial optimization

  2020cites this paper
• DRaWS: A dual random-walk based sampling method to efficiently estimate distributions of degree and clique size over social networks

  2020cites this paper
• Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach

  2020cites this paper
• Efficient maximum clique computation and enumeration over large sparse graphs

  2020influential citation
• Pangolin: An Efficient and Flexible Graph Pattern Mining System on CPU and GPU.

  2020cites this paper
• Efficient temporal core maintenance of massive graphs

  2020cites this paper
• DwarvesGraph: A High-Performance Graph Mining System with Pattern Decomposition

  2020cites this paper
• Ordering heuristics for k-clique listing

  2020cites this paper
• Maximizing the reduction ability for near-maximum independent set computation

  2020cites this paper
• Efficiently Finding a Maximal Clique Summary via Effective Sampling

  2020cites this paper
• Efficient Core Maintenance of Dynamic Graphs

  2020cites this paper
• Fuzzy Clique Set Determination Method as an Example of Fuzzy Temporal Graph Invariant

  2020cites this paper
• Discovering the Maximum Clique in Social Networks Using Artificial Bee Colony Optimization Method

  2019cites this paper
• Graph Iso/Auto-morphism: A Divide-&-Conquer Approach

  2019cites this paper
• Size Watermelon Apple Grape Color Shape Size Size Banana GrapeFruit Lemon Apple Taste

  2019cites this paper
• Efficient Maximum Clique Computation over Large Sparse Graphs

  2019cites this paper
• Improved Algorithms for Maximal Clique Search in Uncertain Networks

  2019cites this paper
• Efficient cohesive subgraph search in big attributed graph data

  2019cites this paper
• Finding a Maximum Clique in Dense Graphs via χ2 Statistics

  2019cites this paper
• Pangolin

  2019cites this paper
• MTSC: An Effective Multiple Time Series Compressing Approach

  2018cites this paper
• A Tutorial on Clique Problems in Communications and Signal Processing

  2018cites this paper
• Representative frequent approximate subgraph mining on multi-graph collections

  2018cites this paper