Our paper titled “Butterfly Counting in Bipartite Networks”, by Vahid Sanei, Ahmet Erdem Sariyuce, and Srikanta Tirthapura has been accepted to appear in the ACM International Conference on Knowledge Discovery and Data Mining (KDD), 2018. This presents a fast method to count subgraphs in large bipartite networks, which are often used to model relationships between two types of entities, say, users and products that they buy. Congrats, Vahid!
