1 code implementation • 8 Dec 2018 • Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyuce, Srikanta Tirthapura
We consider space-efficient single-pass estimation of the number of butterflies, a fundamental bipartite graph motif, from a massive bipartite graph stream where each edge represents a connection between entities in two different partitions.
Data Structures and Algorithms
2 code implementations • 28 Aug 2018 • Seyed-Vahid Sanei-Mehri, Apurba Das, Srikanta Tirthapura
Quasi-cliques are dense incomplete subgraphs of a graph that generalize the notion of cliques.
Data Structures and Algorithms
2 code implementations • 31 Dec 2017 • Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyuce, Srikanta Tirthapura
We consider the problem of counting motifs in bipartite affiliation networks, such as author-paper, user-product, and actor-movie relations.
Discrete Mathematics
