Showing 2025Show all
3 papers · 1 filter
cs.DS2025
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…
cs.DC2025
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…
cs.DC2025
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…