Parallel algorithm to find maximum capacity paths

DOI10.1007/BF02742076zbMath0919.68100OpenAlexW2004886151MaRDI QIDQ1280957

V. I. Khrin, S. V. Listrovoi

Publication date: 15 March 1999

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02742076

zbMATH Keywords

message routing problems

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Quadratic bottleneck problems ⋮ Bottleneck flows in unit capacity networks

Cites Work

• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Network Flow and Testing Graph Connectivity
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel algorithm to find maximum capacity paths