A fully distributed (minimal) spanning tree algorithm
type: Item
instance of: scholarly article
title: A fully distributed (minimal) spanning tree algorithm
zbMATH Open document ID: 0611.05015
DOI: 10.1016/0020-0190(86)90043-8
author: G. Roucairol
author: Ivan Lavallée
published in: Information Processing Letters
publication date: 1986-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3987293
zbMATH Keywords: cooperation
zbMATH Keywords: concurrency
zbMATH Keywords: processes
zbMATH Keywords: communication
zbMATH Keywords: distributed network
zbMATH Keywords: asynchronous distributed algorithm
zbMATH Keywords: minimum spanning tree
reviewed by: Maciej M. Sysło
MaRDI profile type: Publication
full work available at URL: 0020-0190(86)90043-8
OpenAlex ID: W2087528263
cites work: A parallel algorithm for constructing minimum spanning trees
cites work: Q4096964
cites work: Reverse path forwarding of broadcast packets
cites work: Distributed Termination
cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees
description: scientific article; zbMATH DE number 3987293