38 citations · 38 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
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…
Efficient Large-Scale Graph Processing on Hybrid CPU and GPU Systems
Abdullah Gharaibeh, Tahsin Reza, Elizeu Santos-Neto +3
The increasing scale and wealth of inter-connected data, such as those accrued by social network applications, demand the design of new techniques and platforms to efficiently deri…