A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
type: Item
instance of: scholarly article
title: A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
zbMATH Open document ID: 0835.68087
DOI: 10.1016/0898-1221(95)00143-M
author: Pradip K. Srimani
author: Gheorghe Antonoiu
publication date: 1996-01-11T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 820321
zbMATH Keywords: self-stabilizing distributed algorithm
zbMATH Keywords: spanning tree
zbMATH Keywords: connected graph
MaRDI profile type: Publication
cites work: Self-stabilizing systems in spite of distributed control
cites work: A belated proof of self-stabilization
cites work: Stabilizing unison
cites work: Token systems that self-stabilize
cites work: A self-stabilizing algorithm for constructing breadth-first trees
cites work: An exercise in proving self-stabilization with a variant function
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 820321