scientific article; zbMATH DE number 515925

MaRDI QIDQ4283437zbMATH OpenFDO

Authors Farid Alizadeh, Andrew V. Goldberg

Publication date 10 March 1994

zbMATH Keywords

capacitated directed networksmassively parallel environmentspush-relabel

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10)

Recommendations

• On implementing push-relabel method for the maximum flow problem
• On implementing the push-relabel method for the maximum flow problem
• Processor-efficient implementation of a maximum flow algorithm
• Efficient implementation of a synchronous parallel push-relabel algorithm
• A new approach to the maximum-flow problem

Cited in

(7)

• Processor-efficient implementation of a maximum flow algorithm
• On implementing the push-relabel method for the maximum flow problem
• Efficient implementation of a synchronous parallel push-relabel algorithm
• The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
• scientific article; zbMATH DE number 1538873 (Why is no real title available?)
• Algorithm 1002: Graph coloring based parallel push-relabel algorithm for the maximum flow problem
• On implementing push-relabel method for the maximum flow problem

This page was built for publication:

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