A review on algorithms for maximum clique problems

Q Wu, JK Hao - European Journal of Operational Research, 2015 - Elsevier
The maximum clique problem (MCP) is to determine in a graph a clique (ie, a complete
subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other …

Querying k-truss community in large and dynamic graphs

X Huang, H Cheng, L Qin, W Tian, JX Yu - Proceedings of the 2014 ACM …, 2014 - dl.acm.org
Community detection which discovers densely connected structures in a network has been
studied a lot. In this paper, we study online community search which is practically useful but …

Arabesque: a system for distributed graph mining

CHC Teixeira, AJ Fonseca, M Serafini… - Proceedings of the 25th …, 2015 - dl.acm.org
Distributed data processing platforms such as MapReduce and Pregel have substantially
simplified the design and deployment of certain classes of distributed graph analytics …

Approximate closest community search in networks

X Huang, LVS Lakshmanan, JX Yu… - arXiv preprint arXiv …, 2015 - arxiv.org
Recently, there has been significant interest in the study of the community search problem in
social and information networks: given one or more query nodes, find densely connected …

{RStream}: Marrying relational algebra with streaming for efficient graph mining on a single machine

K Wang, Z Zuo, J Thorpe, TQ Nguyen… - 13th USENIX Symposium …, 2018 - usenix.org
Graph mining is an important category of graph algorithms that aim to discover structural
patterns such as cliques and motifs in a graph. While a great deal of work has been done …

Pangolin: An efficient and flexible graph mining system on cpu and gpu

X Chen, R Dathathri, G Gill, K Pingali - Proceedings of the VLDB …, 2020 - dl.acm.org
There is growing interest in graph pattern mining (GPM) problems such as motif counting.
GPM systems have been developed to provide unified interfaces for programming …

Diversified top-k clique search

L Yuan, L Qin, X Lin, L Chang, W Zhang - The VLDB Journal, 2016 - Springer
Maximal clique enumeration is a fundamental problem in graph theory and has been
extensively studied. However, maximal clique enumeration is time-consuming in large …

Efficient maximum clique computation over large sparse graphs

L Chang - Proceedings of the 25th ACM SIGKDD International …, 2019 - dl.acm.org
This paper studies the problem of MCC-Sparse, Maximum Clique Computation over large
real-world graphs that are usually Sparse. In the literature, MCC-Sparse has been studied …

A tutorial on clique problems in communications and signal processing

A Douik, H Dahrouj, TY Al-Naffouri… - Proceedings of the …, 2020 - ieeexplore.ieee.org
Since its first use by Euler on the problem of the seven bridges of Königsberg, graph theory
has shown excellent abilities in solving and unveiling the properties of multiple discrete …

Truss decomposition of probabilistic graphs: Semantics and algorithms

X Huang, W Lu, LVS Lakshmanan - Proceedings of the 2016 …, 2016 - dl.acm.org
A key operation in network analysis is the discovery of cohesive subgraphs. The notion of k-
truss has gained considerable popularity in this regard, based on its rich structure and …