SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE

DOI10.1142/S0129054106003851zbMath1093.68074MaRDI QIDQ5291299

Pradip K. Srimani, Zhen-Yu Xu

Publication date: 10 May 2006

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES ⋮ ANALYSIS OF THE AVERAGE EXECUTION TIME FOR A SELF-STABILIZING LEADER ELECTION ALGORITHM

Cites Work

• An exercise in fault-containment: Self-stabilizing leader election
• Stabilizing unison
• A belated proof of self-stabilization
• Self-stabilizing depth-first search
• Self-stabilizing systems in spite of distributed control
• A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM

This page was built for publication: SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE