On the theoretical efficiency of various network flow algorithms
type: Item
instance of: scholarly article
title: On the theoretical efficiency of various network flow algorithms
zbMATH Open document ID: 0464.68044
DOI: 10.1016/0304-3975(81)90008-6
author: Zvi Galil
published in: Theoretical Computer Science
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 3727626
zbMATH Keywords: network flow algorithms
zbMATH Keywords: maximum flow problem
zbMATH Keywords: upper bounds
MaRDI profile type: Publication
full work available at URL: 0304-3975(81)90008-6
OpenAlex ID: W2085038198
cites work: Q5624995
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Network Flow and Testing Graph Connectivity
cites work: Q5514188
cites work: Maximal Flow Through a Network
cites work: Q4058442
cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks
cites work: Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows
description: scientific article; zbMATH DE number 3727626