252 citations · 842 across the 13 of their papers we have counts for
13 papers
Triadic First-Order Logic Queries in Temporal Networks
Omkar Bhalerao, Yunjie Pan, C. Seshadhri +1
Motif counting is a fundamental problem in network analysis, and there is a rich literature of theoretical and applied algorithms for this problem. Given a large input network ,…
ESCAPE: Efficiently Counting All 5-Vertex Subgraphs
Ali Pinar, C. Seshadhri, V. Vishal
Counting the frequency of small subgraphs is a fundamental technique in network analysis across various domains, most notably in bioinformatics and social networks. The special cas…
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts
Madhav Jha, C. Seshadhri, Ali Pinar
Counting the frequency of small subgraphs is a fundamental technique in network analysis across various domains, most notably in bioinformatics and social networks. The special cas…
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
Ahmet Erdem Sariyuce, C. Seshadhri, Ali Pinar +1
Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. Yet most stan…
Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs
C. Seshadhri, Ali Pinar, Tamara G. Kolda
Graphs are used to model interactions in a variety of contexts, and there is a growing need to quickly assess the structure of such graphs. Some of the most useful graph metrics ar…
A Scalable Generative Graph Model with Community Structure
Tamara G. Kolda, Ali Pinar, Todd Plantenga +1
Network data is ubiquitous and growing, yet we lack realistic generative network models that can be calibrated to match real-world data. The recently proposed Block Two-Level Erdss…