5 papers
HARP-ME: Closure-Driven Exact Induced Motif Enumeration on GPUs
Ashwina Kumar, Rupesh Nasre
Exact induced motif enumeration is a fundamental operation in graph mining, but it remains challenging on GPUs because candidate expansion is irregular, repeated set intersections…
StarDist: A Code Generator for Distributed Graph Algorithms
Barenya Kumar Nandy, Rupesh Nasre
We introduce StarDist, a Domain Specific Language for generating high-performant distributed graph algorithms in the message passing model. Our analysis-transformation framework op…
Efficient Dynamic MaxFlow Computation on GPUs
Shruthi Kannappan, Ashwina Kumar, Rupesh Nasre
Maxflow is a fundamental problem in graph theory and combinatorial optimisation, used to determine the maximum flow from a source node to a sink node in a flow network. It finds ap…
Scalable Maxflow Processing for Dynamic Graphs
Shruthi Kannappan, Ashwina Kumar, Rupesh Nasre
The Maximum Flow (Max-Flow) problem is a cornerstone in graph theory and combinatorial optimization, aiming to determine the largest possible flow from a designated source node to…
Generating Dynamic Graph Algorithms for Multiple Backends for a Graph DSL
Nibedita Behera, Ashwina Kumar, Atharva Chougule +3
With the rapid growth of unstructured and semistructured data, parallelizing graph algorithms has become essential for efficiency. However, due to the inherent irregularity in comp…