1. ABSTRACT Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a given graph, has been extensively studied. Besides its theoretical value as an NPhard problem, the maximum clique problem is known to have direct applications in… (More)

@article{Lu2017FindingTM,
title={Finding the maximum clique in massive graphs},
author={Can Lu and Jeffrey Xu Yu and Hao Wei and Yikai Zhang},
journal={PVLDB},
year={2017},
volume={10},
pages={1538-1549}
}