3 papers
cs.DC2022
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…
cs.DC2021
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…
cs.DC2019
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…