Quick max-flow algorithm
type: Item
instance of: scholarly article
title: Quick max-flow algorithm
zbMATH Open document ID: 1176.68144
author: Przemysław Gordinowicz
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2009-09-18T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5604807
zbMATH Keywords: network flows maximum flow discrete optimization
MaRDI profile type: Publication
full work available at URL: s10852-008-9091-z
OpenAlex ID: W1985325898
cites work: Maximal Flow Through a Network
cites work: Q3292914
cites work: Q5624995
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks
cites work: Q3619797
DOI: 10.1007/S10852-008-9091-Z
Recommended article: A fast maximum flow algorithm
Recommended article: A Fast and Simple Algorithm for the Maximum Flow Problem
Recommended article: Q4010349
Recommended article: A Faster Deterministic Maximum Flow Algorithm
Recommended article: Q4763402
Recommended article: Q4305225
Recommended article: Q3090674
Recommended article: Q3840368
Recommended article: Processor-efficient implementation of a maximum flow algorithm
Recommended article: A Fast Parametric Maximum Flow Algorithm and Applications
description: scientific article; zbMATH DE number 5604807