Time Optimal Asynchronous Self-stabilizing Spanning Tree
From MaRDI portal
Publication:3523201
DOI10.1007/978-3-540-75142-7_10zbMATH Open1145.68346OpenAlexW4212794548MaRDI QIDQ3523201FDOQ3523201
Recommendations
- A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
- A new polynomial silent stabilizing spanning-tree construction algorithm
- scientific article; zbMATH DE number 2006653
- scientific article; zbMATH DE number 4058884
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
Cited in
(18)- Near-optimal knowledge-free resilient leader election
- Acyclic strategy for silent self-stabilization in spanning forests
- Resource efficient stabilization for local tasks despite unknown capacity links
- Distributed edge coloration for bipartite networks
- The first fully polynomial stabilizing algorithm for BFS tree construction
- A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
- Parallel Processing and Applied Mathematics
- A new polynomial silent stabilizing spanning-tree construction algorithm
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
- Optimized silent self-stabilizing scheme for tree-based constructions
- Maintaining balanced trees for structured distributed streaming systems
- Title not available (Why is no real title available?)
- Communication efficient self-stabilizing leader election
- Self-stabilizing silent disjunction in an anonymous network
- Self-stabilizing leader election in polynomial steps
- Analysis of a memory-efficient self-stabilizing BFS spanning tree construction
- A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees
- Self-stabilizing Space Optimal Synchronization Algorithms on Trees
This page was built for publication: Time Optimal Asynchronous Self-stabilizing Spanning Tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523201)
