A Study on the Articulation Node Eliminating Algorithm

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 c...

Full description

Saved in:
Bibliographic Details
Main Authors: Eunjee Lim, Myung-Ki Jung, Seongjin Ahn, Heakro Lee
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Computers
Distributed algorithms
Joining processes
Security
Testing
Topology
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2162-9048
DOI:10.1109/ICISA.2013.6579413