Detail
Článek
Článek online
FT
Medvik - BMČ
  • Je něco špatně v tomto záznamu ?

A deterministic approach for rapid identification of the critical links in networks

R. Vodák, M. Bíl, T. Svoboda, Z. Křivánková, J. Kubeček, T. Rebok, P. Hliněný,

. 2019 ; 14 (7) : e0219658. [pub] 20190717

Jazyk angličtina Země Spojené státy americké

Typ dokumentu časopisecké články, práce podpořená grantem

Perzistentní odkaz   https://www.medvik.cz/link/bmc20006141

We introduce a rapid deterministic algorithm for identification of the most critical links which are capable of causing network disruptions. The algorithm is based on searching for the shortest cycles in the network and provides a significant time improvement compared with a common brute-force algorithm which scans the entire network. We used a simple measure, based on standard deviation, as a vulnerability measure. It takes into account the importance of nodes in particular network components. We demonstrate this approach on a real network with 734 nodes and 990 links. We found the worst scenarios for the cases with and without people living in the nodes. The evaluation of all network breakups can provide transportation planners and administrators with plenty of data for further statistical analyses. The presented approach provides an alternative approach to the recent research assessing the impacts of simultaneous interruptions of multiple links.

Citace poskytuje Crossref.org

000      
00000naa a2200000 a 4500
001      
bmc20006141
003      
CZ-PrNML
005      
20200518132349.0
007      
ta
008      
200511s2019 xxu f 000 0|eng||
009      
AR
024    7_
$a 10.1371/journal.pone.0219658 $2 doi
035    __
$a (PubMed)31314814
040    __
$a ABA008 $b cze $d ABA008 $e AACR2
041    0_
$a eng
044    __
$a xxu
100    1_
$a Vodák, Rostislav $u CDV-Transport Research Centre, Brno, Czech Republic. Faculty of Science, Palacký University, Olomouc, Czech Republic.
245    12
$a A deterministic approach for rapid identification of the critical links in networks / $c R. Vodák, M. Bíl, T. Svoboda, Z. Křivánková, J. Kubeček, T. Rebok, P. Hliněný,
520    9_
$a We introduce a rapid deterministic algorithm for identification of the most critical links which are capable of causing network disruptions. The algorithm is based on searching for the shortest cycles in the network and provides a significant time improvement compared with a common brute-force algorithm which scans the entire network. We used a simple measure, based on standard deviation, as a vulnerability measure. It takes into account the importance of nodes in particular network components. We demonstrate this approach on a real network with 734 nodes and 990 links. We found the worst scenarios for the cases with and without people living in the nodes. The evaluation of all network breakups can provide transportation planners and administrators with plenty of data for further statistical analyses. The presented approach provides an alternative approach to the recent research assessing the impacts of simultaneous interruptions of multiple links.
650    12
$a algoritmy $7 D000465
650    _2
$a sběr dat $7 D003625
650    _2
$a lidé $7 D006801
650    _2
$a záznamy jako téma $7 D011996
650    _2
$a software $7 D012984
650    _2
$a čas $7 D013995
650    12
$a doprava $7 D014186
651    _2
$a Česká republika $7 D018153
655    _2
$a časopisecké články $7 D016428
655    _2
$a práce podpořená grantem $7 D013485
700    1_
$a Bíl, Michal $u CDV-Transport Research Centre, Brno, Czech Republic.
700    1_
$a Svoboda, Tomáš $u CDV-Transport Research Centre, Brno, Czech Republic. CESNET, Prague, Czech Republic.
700    1_
$a Křivánková, Zuzana $u CDV-Transport Research Centre, Brno, Czech Republic.
700    1_
$a Kubeček, Jan $u CDV-Transport Research Centre, Brno, Czech Republic.
700    1_
$a Rebok, Tomáš $u CERIT-SC, Institute of Computer Science, Masaryk University, Brno, Czech Republic.
700    1_
$a Hliněný, Petr $u Faculty of Informatics, Masaryk University, Brno, Czech Republic.
773    0_
$w MED00180950 $t PloS one $x 1932-6203 $g Roč. 14, č. 7 (2019), s. e0219658
856    41
$u https://pubmed.ncbi.nlm.nih.gov/31314814 $y Pubmed
910    __
$a ABA008 $b sig $c sign $y a $z 0
990    __
$a 20200511 $b ABA008
991    __
$a 20200518132349 $b ABA008
999    __
$a ok $b bmc $g 1524999 $s 1096197
BAS    __
$a 3
BAS    __
$a PreBMC
BMC    __
$a 2019 $b 14 $c 7 $d e0219658 $e 20190717 $i 1932-6203 $m PLoS One $n PLoS One $x MED00180950
LZP    __
$a Pubmed-20200511
Zpět

Najít záznam

Citační ukazatele

Pouze přihlášení uživatelé

Možnosti archivace