252 citations · 1.1k across the 38 of their papers we have counts for
7 papers · 1 filter
Batch Dynamic Algorithm to Find k-Cores and Hierarchies
Kasimir Gabert, Ali Pınar, Ümit V. Çatalyürek
Finding -cores in graphs is a valuable and effective strategy for extracting dense regions of otherwise sparse graphs. We focus on the important problem of maintaining cores on…
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…
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…
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…
Constructing and Sampling Graphs with a Prescribed Joint Degree Distribution
Isabelle Stanton, Ali Pinar
One of the most influential recent results in network analysis is that many natural networks exhibit a power-law or log-normal degree distribution. This has inspired numerous gener…
A Linear Approximation Algorithm for 2-Dimensional Vector Packing
Ekow Otoo, Ali Pinar, Doron Rotem
We study the 2-dimensional vector packing problem, which is a generalization of the classical bin packing problem where each item has 2 distinct weights and each bin has 2 correspo…