Constant space self-stabilizing center finding algorithms in chains and trees
From MaRDI portal
Recommendations
- A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
- A self-stabilizing algorithm which finds a 2-center of a tree
- A self-stabilizing distributed algorithm to find the median of a tree graph
- Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
- A self-stabilizing algorithm for finding weighted centroid in trees
Cites work
- A generalized firing squad problem
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
- Distributed algorithms for finding centers and medians in networks
- On probabilistic snap-stabilization
- Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
- Self-stabilizing systems in spite of distributed control
- Snap-stabilization and PIF in tree networks
- Space-optimal rendezvous of mobile agents in asynchronous trees
Cited in
(3)
This page was built for publication: Constant space self-stabilizing center finding algorithms in chains and trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087837)