This study focuses on eliminating the articulation node of a network, the point at which connection is disconnected between nodes when a problem arises during communication. In order to eliminate articulation nodes, this study first takes a basic approach then uses an efficient and cheap method in connecting the subgraphs using edges when the articulation nodes have all been disconnected. In addition, the worst case and best case scenarios will be calculated to generalize the worst cases and best cases according to the number of articulation nodes and the number of leaf graphs.
展开▼
