Parallel algorithm to find maximum capacity paths
type: Item
instance of: scholarly article
title: Parallel algorithm to find maximum capacity paths
zbMATH Open document ID: 0919.68100
DOI: 10.1007/BF02742076
author: S. V. Listrovoi
author: V. I. Khrin
published in: Cybernetics and Systems Analysis
publication date: 1999-03-15T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 1263000
zbMATH Keywords: message routing problems
MaRDI profile type: Publication
cites work: Q4083324
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Q5624995
cites work: Network Flow and Testing Graph Connectivity
full work available at URL: https://doi.org/10.1007/bf02742076
OpenAlex ID: W2004886151
description: scientific article; zbMATH DE number 1263000