scientific article; zbMATH DE number 2006653
From MaRDI portal
Publication:4436052
Recommendations
- A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
- scientific article; zbMATH DE number 4058884
- scientific article; zbMATH DE number 1760042
- A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
Cited in
(16)- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
- Fast self-stabilizing minimum spanning tree construction. Using compact nearest common ancestor labeling scheme
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
- A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
- scientific article; zbMATH DE number 4058884 (Why is no real title available?)
- On underlay-aware self-stabilizing overlay networks
- A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault
- Compact routing messages in self-healing trees
- Time Optimal Asynchronous Self-stabilizing Spanning Tree
- A leader election algorithm for dynamic networks with causal clocks
- A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
- scientific article; zbMATH DE number 1760042 (Why is no real title available?)
- Communication efficient self-stabilizing leader election
- A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees
- Self-stabilizing multicast protocols for ad hoc networks.
- Distributed Computing - IWDC 2003
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436052)
