TY - GEN
T1 - A study on the articulation node eliminating algorithm
AU - Lim, Eunjee
AU - Jung, Myung Ki
AU - Ahn, Seongjin
AU - Lee, Heakro
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
KW - Articulation node eliminating algorithm
KW - Articulation nodes
KW - distance between nodes;
KW - Weak points
UR - https://www.scopus.com/pages/publications/84883827904
U2 - 10.1109/ICISA.2013.6579413
DO - 10.1109/ICISA.2013.6579413
M3 - Conference contribution
AN - SCOPUS:84883827904
SN - 9781479906031
T3 - 2013 International Conference on Information Science and Applications, ICISA 2013
BT - 2013 International Conference on Information Science and Applications, ICISA 2013
T2 - 2013 4th International Conference on Information Science and Applications, ICISA 2013
Y2 - 24 June 2013 through 26 June 2013
ER -