An algorithmic study of the maximum flow problem: A comparative statistical analysis
type: Item
instance of: scholarly article
title: An algorithmic study of the maximum flow problem: A comparative statistical analysis
zbMATH Open document ID: 0966.90067
DOI: 10.1007/BF02564832
author: R. Smith
published in: Top
publication date: 2001-04-02T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 62K99
zbMATH DE Number: 1556329
zbMATH Keywords: network programming
zbMATH Keywords: maximum flow algorithm
zbMATH Keywords: experimental design
zbMATH Keywords: statistical analysis
describes a project that uses: NETGEN
describes a project that uses: DIMACS
MaRDI profile type: Publication
cites work: A Fast and Simple Algorithm for the Maximum Flow Problem
cites work: Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
cites work: Computational investigations of maximum flow algorithms
cites work: Q4403606
cites work: Q5538617
cites work: Analysis of Preflow Push Algorithms for Maximum Network Flow
cites work: Q5624995
cites work: Implementing Goldberg's max-flow-algorithm ? A computational investigation
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Maximal Flow Through a Network
cites work: Q5639225
cites work: Q4058442
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks
cites work: Q4284873
full work available at URL: https://doi.org/10.1007/bf02564832
OpenAlex ID: W1551148555
description: scientific article; zbMATH DE number 1556329