Finding biconnected components in O(n) time for a class of graphs
Information Processing Letters
Data Structures and Problem Solving with C++
Data Structures and Problem Solving with C++
Data Structures and Algorithms
Data Structures and Algorithms
Introduction to Algorithms
Fundamentals of Data Structures in C
Fundamentals of Data Structures in C
An optimal distributed algorithm for finding articulation points in a network
Computer Communications
Network Stability Analysis Techniques Using the Virtual Articulation Node
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Hi-index | 0.00 |
In this study, we examine the stability assessment of the current network by using the number of trees generated when an articulation node within the network becomes functional. As a consequence, we will be able to design networks with more stability using the same amount of resources. Previous studies assessed the stability of a network by using the number of nodes adjacent to a broken node but they were inapplicable to complex networks with more than two broken nodes. The network stability assessment method proposed in this study will be applicable to complex networks with two or more broken nodes and will offer a more detailed assessment by considering the distribution of network risk factors.