Algorithms for All-Pairs Reliable Quickest Paths

机译：全对可靠最快路径的算法

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

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(n~2m), where n and m are the number of nodes and links of the network, respectively.

机译：我们考虑通过网络中最快的路径可靠地传输消息，并为每个链路指定带宽，延迟和可靠性参数。对于大小为σ的消息，我们提出了算法来计算所有对最快最可靠和最可靠的最快路径，每个路径的时间复杂度为O（n〜2m），其中n和m是网络的节点和链路数，分别。

著录项

来源
《International Conference on Computational Science - ICCA 2003 Pt.2 Jun 2-4, 2003 Melbourne, Australia and St. Petersburg, Russia》|2003年|p.678-684|共7页
会议地点 Melbourne(AU) St. Petersburg(RU);Melbourne(AU) St. Petersburg(RU)
作者
Young-Cheol Bang; Nageswara S.V. Rao; S. Radhakrishnan;
展开▼
作者单位

Department of Computer Engineering, Korea Polytechnic University Kyunggi-Do, Korea;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类自动化技术、计算机技术;
关键词

相似文献

外文文献
中文文献
专利

1. Algorithms for the quickest path problem and the reliable quickest path problem [J] . Herminia I. Calvete, Lourdes del-Pozo, Jose A. Iranzo Computational management science . 2012,第2期

机译：最快路径问题和可靠最快路径问题的算法
2. Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs [J] . Adam Karczmarz, Jakub Lacki LIPIcs : Leibniz International Proceedings in Informatics . 2019,第1期

机译：有向图中部分动态全对最短路径的可靠集线器
3. Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths [J] . Stefan Kratsch, Florian Nelles LIPIcs : Leibniz International Proceedings in Informatics . 2020,第30期

机译：用于计算全对最短路径的高效参数化算法
4. Algorithms for All-Pairs Reliable Quickest Paths [C] . Young-Cheol Bang, Nageswara S. V. Rao, S. Radhakrishnan International Conference on Computational Science . 2003

机译：全对可靠的最快路径的算法
5. Reliable Shortest Path Problems in Networks under Uncertainty: Models, Algorithms and Applications. [D] . Chen, Bi Yu. 2012

机译：不确定性下网络中可靠的最短路径问题：模型，算法和应用。
6. Accelerating the Smith-Waterman algorithm with interpair pruning and band optimization for the all-pairs comparison of base sequences [O] . Daiki Okada, Fumihiko Ino, Kenichi Hagihara 2015

机译：通过对间修剪和带优化来加速Smith-Waterman算法以对碱基序列进行全对比较
7. On Algorithm for All-Pairs Most Reliable Quickest Paths [O] . Young-Cheol Bang, Inki Hong, Hyunseung Choo 2004

机译：关于全对最可靠的最快路径的算法
8. Minimizing Communication in All-Pairs Shortest Paths. [R] . A. Buluc E. Solomonik J. Demmel 2013

机译：最小化所有对最短路径中的通信。

Algorithms for All-Pairs Reliable Quickest Paths

摘要

著录项

相似文献

相关主题

期刊订阅