Fast data transmission and maximal dynamic flow.

DOI10.1016/S0020-0190(98)00047-7zbMath1078.90515OpenAlexW2064946863MaRDI QIDQ2583548

J. Ben Rosen, Guoliang Xue, Shangzhi Sun

Publication date: 17 January 2006

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00047-7

zbMATH Keywords

AlgorithmsCommunication networksShortest pathsMaximal dynamic flowsMinimum transmission timeQuickest paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Stochastic network models in operations research (90B15)

Related Items (4)

A label-setting algorithm for finding a quickest path ⋮ Fast and fine quickest path algorithm ⋮ On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints ⋮ Terminal pair maximal flow finding using DNA computation

Cites Work

• Unnamed Item
• The quickest path problem
• Algorithms for the quickest path problem and the enumeration of quickest paths
• Distributed algorithms for the quickest path problem
• An algorithm for finding the \(k\) quickest paths in a network
• On the quickest path problem
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• Finding the \(k\) quickest simple paths in a network
• The all-pairs quickest path problem
• On the computation of fast data transmissions in networks with capacities and delays
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: Fast data transmission and maximal dynamic flow.