Parallel algorithm to find maximum capacity paths

DOI10.1007/BF02742076MaRDI QIDQ1280957zbMATH OpenOpenAlexFDO

Authors S. V. Listrovoi, V. I. Khrin

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

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

Recommendations

• A parallel optimal routing algorithm
• Flow maximization problem as linear programming problem with capacity constraints
• scientific article; zbMATH DE number 4139463
• scientific article; zbMATH DE number 1041832

Cites work

• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• Network Flow and Testing Graph Connectivity
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(6)

• Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem
• scientific article; zbMATH DE number 1041832 (Why is no real title available?)
• Flow maximization problem as linear programming problem with capacity constraints
• Quadratic bottleneck problems
• A linear time algorithm for the maximum capacity path problem
• Bottleneck flows in unit capacity networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280957)