18 citations · 20 across the 5 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2014★ 18 cited
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…
cs.DS2013★ 1 cited
Counting Triangles in Real-World Graph Streams: Dealing with Repeated Edges and Time Windows
Madhav Jha, C. Seshadhri, Ali Pinar
Real-world graphs often manifest as a massive temporal stream of edges. The need for real-time analysis of such large graph streams has led to progress on low memory, one-pass stre…
cs.DS2012
A space efficient streaming algorithm for triangle counting using the birthday paradox
Madhav Jha, C. Seshadhri, Ali Pinar
We design a space efficient algorithm that approximates the transitivity (global clustering coefficient) and total triangle count with only a single pass through a graph given as a…