A fully distributed (minimal) spanning tree algorithm (Q1087548)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fully distributed (minimal) spanning tree algorithm |
scientific article; zbMATH DE number 3987293
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully distributed (minimal) spanning tree algorithm |
scientific article; zbMATH DE number 3987293 |
Statements
A fully distributed (minimal) spanning tree algorithm (English)
0 references
1986
0 references
An asynchronous distributed algorithm is described which determines a minimum spanning tree of a graph. The algorithm is shown to be superior to that of Gallagher et al.
0 references
cooperation
0 references
concurrency
0 references
processes
0 references
communication
0 references
distributed network
0 references
asynchronous distributed algorithm
0 references
minimum spanning tree
0 references
