当前位置:
X-MOL 学术
›
Phys. Commun.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
An O(|E|) time algorithm to find a bottleneck link in single rate two-pair networks
Physical Communication ( IF 2.0 ) Pub Date : 2020-08-22 , DOI: 10.1016/j.phycom.2020.101191 Sepideh Ghazvineh , Mehdi Ghiyasvand
中文翻译:
一个 时间算法在单速率两对网络中查找瓶颈链路
更新日期:2020-08-22
Physical Communication ( IF 2.0 ) Pub Date : 2020-08-22 , DOI: 10.1016/j.phycom.2020.101191 Sepideh Ghazvineh , Mehdi Ghiyasvand
This paper presents a new algorithm to find a bottleneck link in single rate two-pair networks using the region decomposition method. The algorithm runs in time, which improves upon the previous polynomial time of due to Cai and Fan (2006), where and denote the number of edges and nodes, respectively.
中文翻译:
一个 时间算法在单速率两对网络中查找瓶颈链路
本文提出了一种使用区域分解法在单速率两对网络中寻找瓶颈链路的新算法。该算法在 时间,这比以前的多项式时间 由于Cai和Fan(2006), 和 分别表示边和节点的数量。