Time Optimal Asynchronous Self-stabilizing Spanning Tree

DOI10.1007/978-3-540-75142-7_10MaRDI QIDQ3523201zbMATH OpenOpenAlexFDO

Authors Shay Kutten, J. Burman

Publication date 2 September 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-75142-7_10

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

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

(21)

• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
• Optimized silent self-stabilizing scheme for tree-based constructions
• Near-optimal knowledge-free resilient leader election
• The first fully polynomial stabilizing algorithm for BFS tree construction
• Distributed edge coloration for bipartite networks
• Maintaining balanced trees for structured distributed streaming systems
• Analysis of a memory-efficient self-stabilizing BFS spanning tree construction
• A new polynomial silent stabilizing spanning-tree construction algorithm
• Self-stabilizing Space Optimal Synchronization Algorithms on Trees
• A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees
• scientific article; zbMATH DE number 2061546 (Why is no real title available?)
• Self-stabilizing silent disjunction in an anonymous network
• Self-stabilizing leader election in polynomial steps
• Parallel Processing and Applied Mathematics
• Acyclic strategy for silent self-stabilization in spanning forests
• Self-stabilizing minimum degree spanning tree within one from the optimal degree
• Communication efficient self-stabilizing leader election
• Resource efficient stabilization for local tasks despite unknown capacity links
• Asynchronous self-stabilization made fast, simple, and energy-efficient
• On self-stabilizing leader election in directed networks
• Being efficient in time, space, and workload: a self-stabilizing unison and its consequences

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)