ON THE PRACTICAL EFFICIENCY OF VARIOUS MAXIMUM FLOW ALGORITHMS
From MaRDI portal
Publication:4745582
DOI10.15807/jorsj.26.61zbMath0507.90028OpenAlexW2136978926MaRDI QIDQ4745582
Publication date: 1983
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.26.61
computational experimentsdepth-first searchcomparison of algorithmsworst case complexitybreadth-first searchmaximum flow algorithmspractical efficiency
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)
Related Items (3)
Enhanced instance space analysis for the maximum flow problem ⋮ Computational investigations of maximum flow algorithms ⋮ Implementing Goldberg's max-flow-algorithm ? A computational investigation
This page was built for publication: ON THE PRACTICAL EFFICIENCY OF VARIOUS MAXIMUM FLOW ALGORITHMS