Our paper “Incremental Maintenance of Maximal Cliques in a Dynamic Graph” by Apurba Das, Michael Svendsen, and Srikanta Tirthapura, has been accepted to appear in the VLDB Journal. This work presents efficient algorithms for a fundamental graph mining problem — maintaining the set of maximal cliques within a dynamic graph whose edge set may change with time. The VLDB Journal is a top-tier journal in the area of database systems. Congrats, Apurba and Michael!
