Graph-based ahead monitoring of vulnerabilities in large dynamic transportation networks.
Betweenness Centrality (BC) has proven to be a fundamental metric in many domains to identify the components (nodes) of a system modelled as a graph that are mostly traversed by information flows thus being critical to the proper functioning of the system itself. In the transportation domain, the me...
Main Authors: | Angelo Furno, Nour-Eddin El Faouzi, Rajesh Sharma, Eugenio Zimeo |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2021-01-01
|
Series: | PLoS ONE |
Online Access: | https://doi.org/10.1371/journal.pone.0248764 |
Similar Items
-
Fast cluster-based computation of exact betweenness centrality in large graphs
by: Cecile Daniel, et al.
Published: (2021-06-01) -
Vulnerability to disasters: Are we moving ahead?
by: Saurabh R Shrivastava, et al.
Published: (2012-01-01) -
Assessing vulnerabilities in transport networks: a graph-theoretic approach
by: André Borgato Morelli, et al.
Published: (2021-04-01) -
Intelligent Attack Graph Generator Adapting to Large Vulnerability Information
by: Chung-Yin Lin, et al.
Published: (2003) -
Aspects of graph vulnerability.
by: Day, David Peter.
Published: (2012)