Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm

DOI10.1007/978-3-662-48350-3_10zbMath1465.68308arXiv1507.01926OpenAlexW1579668635MaRDI QIDQ3452773

Niklas Baumstark, Julian Shun, Guy E. Blelloch

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.01926

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (1)

Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm

Uses Software

• KaFFPa
• DIMACS
• CMU Benchmarks

Cites Work

• Unnamed Item
• Unnamed Item
• On implementing the push-relabel method for the maximum flow problem
• Maximum Flows by Incremental Breadth-First Search
• Engineering Multilevel Graph Partitioning Algorithms
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
• Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm
• A new approach to the maximum-flow problem
• An O(n2log n) parallel max-flow algorithm
• Graph Partitioning and Graph Clustering
• A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem

This page was built for publication: Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm