Vulnerability in Networks - A Survey مقاله
نویسنده: Moazzami، Dara ؛
Journal of Algorithms and Computation June 2018,Volume 50, Nuber 1 (10 صفحه - از 109 تا 118)
The analysis of vulnerability in networks generally involves some questionsabout how the underlying graph is connected. One is naturally interestedin studying the types of disruption in the network that maybe causedby failures of certain links or nodes. In terms of a graph, the concept ofconnectedness is used in different forms to study many of the measuresof vulnerability. When certain vertices or edges of a connected graphare deleted, one wants to know whether the remaining graph is stillconnected, and if so, what its vertex - or edge - connectivity is. If on theother hand, the graph is disconnected, the determination of the number ofits components or their orders is useful. Our purpose here is to describeand analyses the current status of the vulnerability measures, identify itsmore interesting variants, and suggest a most suitable measure ofvulnerability.کلیدواژه ها:
- دریافت فایل ارجاع :
- (پژوهیار, , , )
You should become a Sign in to be able to see articles.
If you fail to purchase subscription via PayPal or VISA Card, please send your mobile number to the Website Administrator via firstname.lastname@example.org.