8 papers
Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs
Tahsin Reza, Geoffrey Sanders, Roger Pearce
Given an edge-weighted graph and a set of known seed vertices, a network scientist often desires to understand the graph relationships to explain connections between the seed verti…
TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal Graphs with Metadata
Trevor Steil, Tahsin Reza, Keita Iwabuchi +3
Understanding the higher-order interactions within network data is a key objective of network science. Surveys of metadata triangles (or patterned 3-cycles in metadata-enriched gra…
Scaling Graph Clustering with Distributed Sketches
Benjamin W. Priest, Alec Dunton, Geoffrey Sanders
The unsupervised learning of community structure, in particular the partitioning vertices into clusters or communities, is a canonical and well-studied problem in exploratory graph…
Scalable Pattern Matching in Metadata Graphs via Constraint Checking
Tahsin Reza, Hassan Halawa, Matei Ripeanu +2
Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: they do not scale to process large graphs a…
Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms
L. Minah Yang, Alyson Fox, Geoffrey Sanders
Although mixed precision arithmetic has recently garnered interest for training dense neural networks, many other applications could benefit from the speed-ups and lower storage co…
On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices
Geoffrey Sanders, Roger Pearce, Timothy La Fond +1
Researchers developing implementations of distributed graph analytic algorithms require graph generators that yield graphs sharing the challenging characteristics of real-world gra…