Efficient Maximum Clique Computation over Large Sparse Graphs

Lijun Chang. Efficient Maximum Clique Computation over Large Sparse Graphs. In Ankur Teredesai, Vipin Kumar, Ying Li, RĂ³mer Rosales, Evimaria Terzi, George Karypis, editors, Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2019, Anchorage, AK, USA, August 4-8, 2019. pages 529-538, ACM, 2019. [doi]

Abstract

Abstract is missing.