Algorithm 1002: Graph coloring based parallel push-relabel algorithm for the maximum flow problem

DOI10.1145/3330481MaRDI QIDQ4960971zbMATH OpenOpenAlexWikidataFDO

Authors Gökçehan Kara, C. Özturan

Publication date 24 April 2020

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3330481

zbMATH Keywords

minimum cut problempreflow-push algorithmvertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Flows in graphs (05C21) Parallel algorithms in computer science (68W10)

Recommendations

• A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
• scientific article; zbMATH DE number 515925
• On implementing the push-relabel method for the maximum flow problem
• The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
• Efficient implementation of a synchronous parallel push-relabel algorithm

Cited in

(2)

• Algorithm 1002
• Scalable high-quality hypergraph partitioning

Describes a project that uses

Uses Software

• CUDA
• DIMACS
• KaHIP

This page was built for publication: Algorithm 1002: Graph coloring based parallel push-relabel algorithm for the maximum flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4960971)