scientific article; zbMATH DE number 1760042
From MaRDI portal
Publication:4536977
Recommendations
- A distributed algorithm for constructing a minimum diameter spanning tree
- A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
- A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
- scientific article; zbMATH DE number 2006653
- A fully distributed (minimal) spanning tree algorithm
- scientific article; zbMATH DE number 1442016
- A uniform self-stabilizing minimum diameter spanning tree algorithm
- A self-stabilizing algorithm for constructing spanning trees
- A faster distributed protocol for constructing a minimum spanning tree
Cited in
(11)- A self-stabilizing distributed algorithm to find the median of a tree graph
- A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
- A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
- A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
- SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS
- A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
- scientific article; zbMATH DE number 3990855 (Why is no real title available?)
- scientific article; zbMATH DE number 2006653 (Why is no real title available?)
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
- Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks
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 Q4536977)
