Sequential and parallel algorithms for minimum flows.
type: Item
instance of: scholarly article
title: Sequential and parallel algorithms for minimum flows.
zbMATH Open document ID: 1139.90335
DOI: 10.1007/BF02935746
author: Eleonor Ciurea
author: Laura Ciupală
published in: Journal of Applied Mathematics and Computing
publication date: 2004-09-28T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 2103971
zbMATH Keywords: network flow
zbMATH Keywords: network algorithms
zbMATH Keywords: minimum flow problem
zbMATH Keywords: parallel algorithms
MaRDI profile type: Publication
cites work: Q3056948
cites work: Some Recent Advances in Network Flows
cites work: A Fast and Simple Algorithm for the Maximum Flow Problem
cites work: Improved Time Bounds for the Maximum Flow Problem
cites work: Processor-efficient implementation of a maximum flow algorithm
cites work: A new approach to the maximum-flow problem
cites work: A parallel algorithm for finding a blocking flow in an acyclic network
cites work: Q4058442
cites work: An O(n2log n) parallel max-flow algorithm
full work available at URL: https://doi.org/10.1007/bf02935746
OpenAlex ID: W2014993890
description: scientific article; zbMATH DE number 2103971