A SELF-STABILIZING ALGORITHM FOR FINDING ARTICULATION POINTS

DOI10.1142/S0129054199000046zbMath1319.68029MaRDI QIDQ5248989

Mehmet Hakan Karaata

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

distributed systemsfault-toleranceself-stabilizationarticulation pointcut-node

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (3)

SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS ⋮ An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity ⋮ An optimal self-stabilizing strarvation-free alternator

Cites Work

• Probabilistic self-stabilization
• Some beautiful arguments using mathematical induction
• A self-stabilizing algorithm for constructing breadth-first trees
• Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
• Self-stabilization (in spite of distributed control) in tree-structured systems
• A self-stabilizing algorithm for coloring planar graphs

This page was built for publication: A SELF-STABILIZING ALGORITHM FOR FINDING ARTICULATION POINTS