Skip to main content
Journal ArticleOPEN ACCESS

Algorithms for all-pairs reliable quickest paths

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2658 678-684
DOI: 10.1007/3-540-44862-4_73
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider the reliable transmission of messages via quickest paths in a network with bandwidth, delay and reliability parameters specified for each link. For a message of size σ, we present algorithms to compute all-pairs quickest most-reliable and most-reliable quickest paths each with time complexity O(n2m), where n and m are the number of nodes and links of the network, respectively. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Bang, Y. C., Rao, N. S. V., & Radhakrishnan, S. (2003). Algorithms for all-pairs reliable quickest paths. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2658, 678–684. https://doi.org/10.1007/3-540-44862-4_73

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free