Efficient Dynamic MaxFlow Computation on GPUs
Fuente:
arXiv
Saved in:
| Main Authors: | Kannappan, Shruthi, Kumar, Ashwina, Nasre, Rupesh |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Scalable Maxflow Processing for Dynamic Graphs
by: Kannappan, Shruthi, et al.
Published: (2025)
by: Kannappan, Shruthi, et al.
Published: (2025)
Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
by: Hsieh, Chou-Ying, et al.
Published: (2024)
by: Hsieh, Chou-Ying, et al.
Published: (2024)
Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
by: Sahu, Abhijeet, et al.
Published: (2026)
by: Sahu, Abhijeet, et al.
Published: (2026)
Min-Max Correlation Clustering via Neighborhood Similarity
by: Cao, Nairen, et al.
Published: (2025)
by: Cao, Nairen, et al.
Published: (2025)
Parallel and (Nearly) Work-Efficient Dynamic Programming
by: Ding, Xiangyun, et al.
Published: (2024)
by: Ding, Xiangyun, et al.
Published: (2024)
GPU-RMQ: Accelerating Range Minimum Queries on Modern GPUs
by: Kreis, Lara, et al.
Published: (2026)
by: Kreis, Lara, et al.
Published: (2026)
Constrained Cuts, Flows, and Lattice-Linearity
by: Streit, Robert, et al.
Published: (2025)
by: Streit, Robert, et al.
Published: (2025)
Distributed Maximum Flow in Planar Graphs
by: Abd-Elhaleem, Yaseen, et al.
Published: (2024)
by: Abd-Elhaleem, Yaseen, et al.
Published: (2024)
Computing in a Faulty Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)
by: Censor-Hillel, Keren, et al.
Published: (2025)
On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)
by: Censor-Hillel, Keren, et al.
Published: (2024)
Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
by: Polyanskii, Nikita, et al.
Published: (2024)
by: Polyanskii, Nikita, et al.
Published: (2024)
Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
by: Yang, Mingqi
Published: (2024)
by: Yang, Mingqi
Published: (2024)
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
by: Dhulipala, Laxman, et al.
Published: (2024)
by: Dhulipala, Laxman, et al.
Published: (2024)
Round and Communication Efficient Graph Coloring
by: Chang, Yi-Jun, et al.
Published: (2024)
by: Chang, Yi-Jun, et al.
Published: (2024)
Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems
by: Garg, Vijay K., et al.
Published: (2026)
by: Garg, Vijay K., et al.
Published: (2026)
What Can We Compute in a Single Round of the Congested Clique?
by: Robinson, Peter
Published: (2022)
by: Robinson, Peter
Published: (2022)
Parallel Dynamic Maximal Matching
by: Ghaffari, Mohsen, et al.
Published: (2024)
by: Ghaffari, Mohsen, et al.
Published: (2024)
Time-Optimal and Energy-Efficient Deterministic Consensus
by: Meir, Shachar, et al.
Published: (2025)
by: Meir, Shachar, et al.
Published: (2025)
Efficient Enumeration of Large Maximal k-Plexes
by: Cheng, Qihao, et al.
Published: (2024)
by: Cheng, Qihao, et al.
Published: (2024)
Parallel Contraction Hierarchies Can Be Efficient and Scalable
by: Wan, Zijin, et al.
Published: (2024)
by: Wan, Zijin, et al.
Published: (2024)
Dynamic Maximal Matching in Clique Networks
by: Li, Minming, et al.
Published: (2024)
by: Li, Minming, et al.
Published: (2024)
Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)
by: Censor-Hillel, Keren, et al.
Published: (2025)
BLEST: Blazingly Efficient BFS using Tensor Cores
by: Elbek, Deniz, et al.
Published: (2025)
by: Elbek, Deniz, et al.
Published: (2025)
Energy-Efficient Maximal Independent Sets in Radio Networks
by: Banasik, Dominick, et al.
Published: (2025)
by: Banasik, Dominick, et al.
Published: (2025)
Two Efficient Message-passing Exclusive Scan Algorithms
by: Träff, Jesper Larsson
Published: (2026)
by: Träff, Jesper Larsson
Published: (2026)
Fast and Space-Efficient Parallel Algorithms for Influence Maximization
by: Wang, Letong, et al.
Published: (2023)
by: Wang, Letong, et al.
Published: (2023)
Parallel Batch-Dynamic Maximal Independent Set
by: Blelloch, Guy, et al.
Published: (2026)
by: Blelloch, Guy, et al.
Published: (2026)
An Implementation and Experimental Comparison of Dynamic Ordered Sets
by: Malek, Jordan
Published: (2024)
by: Malek, Jordan
Published: (2024)
Efficient calculation of available space for multi-NUMA virtual machines
by: Gudkov, Andrei, et al.
Published: (2026)
by: Gudkov, Andrei, et al.
Published: (2026)
Efficient Distributed Data Structures for Future Many-core Architectures
by: Fatourou, Panagiota, et al.
Published: (2024)
by: Fatourou, Panagiota, et al.
Published: (2024)
Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
by: De Man, Quinten, et al.
Published: (2025)
by: De Man, Quinten, et al.
Published: (2025)
DGAP: Efficient Dynamic Graph Analysis on Persistent Memory
by: Islam, Abdullah Al Raqibul, et al.
Published: (2024)
by: Islam, Abdullah Al Raqibul, et al.
Published: (2024)
ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting
by: Shovan, S. M., et al.
Published: (2025)
by: Shovan, S. M., et al.
Published: (2025)
FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
by: Dang'ana, Michael
Published: (2026)
by: Dang'ana, Michael
Published: (2026)
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
by: Chang, Yi-Jun
Published: (2023)
by: Chang, Yi-Jun
Published: (2023)
Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
by: Chang, Yi-Jun, et al.
Published: (2026)
by: Chang, Yi-Jun, et al.
Published: (2026)
Evaluation of Dynamic Vector Bin Packing for Virtual Machine Placement
by: Lee, Zong Yu, et al.
Published: (2026)
by: Lee, Zong Yu, et al.
Published: (2026)
Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
by: Blelloch, Guy E., et al.
Published: (2025)
by: Blelloch, Guy E., et al.
Published: (2025)
A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
by: Cambus, Mélanie, et al.
Published: (2022)
by: Cambus, Mélanie, et al.
Published: (2022)
Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
by: Blelloch, Guy, et al.
Published: (2026)
by: Blelloch, Guy, et al.
Published: (2026)
Similar Items
-
Scalable Maxflow Processing for Dynamic Graphs
by: Kannappan, Shruthi, et al.
Published: (2025) -
Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
by: Hsieh, Chou-Ying, et al.
Published: (2024) -
Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
by: Sahu, Abhijeet, et al.
Published: (2026) -
Min-Max Correlation Clustering via Neighborhood Similarity
by: Cao, Nairen, et al.
Published: (2025) -
Parallel and (Nearly) Work-Efficient Dynamic Programming
by: Ding, Xiangyun, et al.
Published: (2024)