Snap-stabilizing depth-first search on arbitrary networks

DOI10.1007/11516798_20MaRDI QIDQ5713673zbMATH OpenOpenAlexFDO

Authors Alain Cournier, Stéphane Devismes, Franck Petit, Vincent Villain

Publication date 15 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b138689

zbMATH Keywords

depth-first searchDistributed systemsfault-tolerancestabilization

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• A Snap-Stabilizing DFS with a Lower Space Requirement
• An improved snap-stabilizing PIF algorithm
• Self-stabilizing depth-first token circulation on networks
• Snap-stabilization and PIF in tree networks
• Fast self-stabilizing depth-first token circulation

Cited in

(5)

• Self-stabilizing depth-first token circulation on networks
• A Snap-Stabilizing DFS with a Lower Space Requirement
• Snap-Stabilizing Waves in Anonymous Networks
• Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles
• Snap-stabilization in message-passing systems

This page was built for publication: Snap-stabilizing depth-first search on arbitrary networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713673)