DocumentCode
2893309
Title
A Study on the Articulation Node Eliminating Algorithm
Author
Eunjee Lim ; Myung-Ki Jung ; Seongjin Ahn ; Heakro Lee
Author_Institution
Dept. of Comput. Educ., Sungkyunkwan Univ., Seoul, South Korea
fYear
2013
fDate
24-26 June 2013
Firstpage
1
Lastpage
4
Abstract
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.
Keywords
algorithm theory; network theory (graphs); articulation node disconnection; articulation node eliminating algorithm; best case scenario; graph edges; leaf graphs; subgraph connection; worst case scenario; Algorithm design and analysis; Computers; Distributed algorithms; Joining processes; Security; Testing; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Science and Applications (ICISA), 2013 International Conference on
Conference_Location
Suwon
Print_ISBN
978-1-4799-0602-4
Type
conf
DOI
10.1109/ICISA.2013.6579413
Filename
6579413
Link To Document