On implementing the push-relabel method for the maximum flow problem
From MaRDI portal
Publication:1386767
DOI10.1007/PL00009180zbMath0898.68029WikidataQ59700076 ScholiaQ59700076MaRDI QIDQ1386767
Andrew V. Goldberg, Boris V. Cherkassky
Publication date: 26 May 1998
Published in: Algorithmica (Search for Journal in Brave)
68W10: Parallel algorithms in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts, Strong Formulations for 2-Node-Connected Steiner Network Problems, Improved algorithms for the Steiner problem in networks, An efficient network flow code for finding all minimum cost \(s-t\) cutsets, An exact algorithm for solving the vertex separator problem, Models and methods for standardization problems, MIP models for connected facility location: a theoretical and computational study, Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates, Approximation algorithms for treewidth, Anomalous electrical and frictionless flow conductance in complex networks, Transport between multiple users in complex networks, Low-energy excitations in the three-dimensional random-field Ising model, Computational investigations of maximum flow algorithms, A generalization of the scaling max-flow algorithm, Partition-based logical reasoning for first-order and propositional theories, Efficient preflow push algorithms, A surface reconstruction method using global graph cut optimization, An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem, Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems, Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice, A new?old algorithm for minimum-cut and maximum-flow in closure graphs, Dimensioning multicast-enabled communications networks
