Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Minimum cuts in near-linear time
Journal of the ACM (JACM)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Self-Stabilizing Network Orientation Algorithms In Arbitrary Rooted Networks
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Self-stabilizing depth-first token circulation in arbitrary rooted networks
Distributed Computing
Self-stabilizing depth-first token circulation on networks
Distributed Computing - Special issue: Self-stabilization
Snap-stabilizing depth-first search on arbitrary networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Snap-stabilization in message-passing systems
Journal of Parallel and Distributed Computing
A new polynomial silent stabilizing spanning-tree construction algorithm
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. Here, we present the first snap-stabilizing protocol for arbitrary rooted networks which detects if a set of nodes is a cutset. This protocol is based on the depth-first search (DFS) traversal and its properties. One of the most interesting properties of our protocol is that, despite the initial configuration, as soon as the protocol is initiated by the root, the result obtained from the computations will be right. So, after the first execution of the protocol, the root is able to take a decision: “the input set is a cutset or not”, and this decision is right.