Abstract
A self-stabilizing algorithm for detecting the articulation points of a connected undirected graph on an asynchronous distributed model of computation is proposed in this note. For a given graph if the deletion of a node splits the graph into two or more components then that node is called an articulation point. The algorithm is resilient to transient faults and does not require initialization.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
