Our paper titled “Shared-Memory Parallel Maximal Clique Enumeration”, by Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura, has been accepted to appear in IEEE International Conference on High Performance Computing, Data, and Analytics (HiPC) 2018. This work describes a shared-memory parallel method and implementation for finding maximal cliques (dense subgraphs) within a graph. Congrats, Apurba and Vahid!
