192 citations · 271 across the 11 of their papers we have counts for
11 papers
Optimal accuracy for linear sets of equations with the graph Laplacian
Richard B. Lehoucq, Michael Weylandt, Jonathan W. Berry
We show that certain Graph Laplacian linear sets of equations exhibit optimal accuracy, guaranteeing that the relative error is no larger than the norm of the relative residual and…
PGAbB: A Block-Based Graph Processing Framework for Heterogeneous Platforms
Abdurrahman Yasar, Sivasankaran Rajamanickam, Jonathan W. Berry +1
Designing flexible graph kernels that can run well on various platforms is a crucial research problem due to the frequent usage of graphs for modeling data and recent architectural…
Connected Components for Infinite Graph Streams: Theory and Practice
Jonathan W. Berry, Cynthia A Phillips, Alexandra M. Porter
Motivated by the properties of unending real-world cybersecurity streams, we present a new graph streaming model: XStream. We maintain a streaming graph and its connected component…
A Deterministic Hitting-Time Moment Approach to Seed-set Expansion over a Graph
Alexander H. Foss, Richard B. Lehoucq, W. Zachary Stuart +2
We introduce HITMIX, a new technique for network seed-set expansion, i.e., the problem of identifying a set of graph vertices related to a given seed-set of vertices. We use the mo…
A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
Abdurrahman Yaşar, Sivasankaran Rajamanickam, Jonathan Berry +1
Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both seque…
The Online Event-Detection Problem
Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton +5
Given a stream , a -heavy hitter is an item that occurs at least times in . The problem of finding heavy-hitters has been extensively stu…