On algorithm for all-pairs most reliable quickest paths

DOI10.1007/978-3-540-24685-5_102MaRDI QIDQ5712849zbMATH OpenOpenAlexFDO

Authors Young-Cheol Bang, Inki Hong, Hyunseung Choo

Publication date 23 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Algorithms for the quickest path problem and the reliable quickest path problem
• On the quickest path problem
• Finding the \(k\) quickest simple paths in a network
• Probabilistic quickest path algorithm
• The all-pairs quickest path problem

Cited in

(3)

• Probabilistic quickest path algorithm
• scientific article; zbMATH DE number 5289563 (Why is no real title available?)
• Algorithms for the quickest path problem and the reliable quickest path problem

This page was built for publication: On algorithm for all-pairs most reliable quickest paths

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