作者: Rostislav Vodák , Michal Bíl , Tomáš Svoboda , Zuzana Křivánková , Jan Kubeček
DOI: 10.1371/JOURNAL.PONE.0219658
关键词: Standard deviation 、 Measure (data warehouse) 、 SIMPLE (military communications protocol) 、 Vulnerability (computing) 、 Deterministic algorithm 、 Distributed computing 、 Rapid identification 、 Identification (information) 、 Computer science
摘要: We introduce a rapid deterministic algorithm for identification of the most critical links which are capable causing network disruptions. The is based on searching shortest cycles in and provides significant time improvement compared with common brute-force scans entire network. used simple measure, standard deviation, as vulnerability measure. It takes into account importance nodes particular components. demonstrate this approach real 734 990 links. found worst scenarios cases without people living nodes. evaluation all breakups can provide transportation planners administrators plenty data further statistical analyses. presented an alternative to recent research assessing impacts simultaneous interruptions multiple