Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Searching the Shortest Pair of Edge-Disjoint Paths in a Communication Network. A Fuzzy Approach
L Valdés, A Ariza, SM Allende, G Joya - … , Gran Canaria, Spain, June 12-14 …, 2019 - Springer
In this paper, we address the problem of finding the shortest pair of edge-disjoint paths
between two nodes in a communication network. We use a new cost function named …
between two nodes in a communication network. We use a new cost function named …