An efficient distributed algorithm for centering a spanning tree of a biconnected graph
type: Item
instance of: scholarly article
title: An efficient distributed algorithm for centering a spanning tree of a biconnected graph
zbMATH Open document ID: 0900.68333
DOI: 10.1016/0020-0190(96)00102-0
author: R. F. M. Aranha
author: C. Pandu Rangan
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 983277
zbMATH Keywords: Algorithms
zbMATH Keywords: Distributed graph algorithms
zbMATH Keywords: Biconnected graphs
zbMATH Keywords: st-numbering
zbMATH Keywords: Center
zbMATH Keywords: Spanning tree
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00102-0
OpenAlex ID: W2082151635
cites work: Centering a spanning tree of a biconnected graph
cites work: Computing an st-numbering
cites work: Q3883524
cites work: A linear algorithm for centering a spanning tree of a biconnected graph
cites work: Q4942257
Wikidata QID: Q127676128
Recommended article: A linear algorithm for centering a spanning tree of a biconnected graph
Recommended article: Centering a spanning tree of a biconnected graph
Recommended article: A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
Recommended article: Distributed Algorithms for Finding Central Paths in Tree Networks
Recommended article: Q3676066
Recommended article: Q3793745
Recommended article: A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
Recommended article: A distributed algorithm for constructing a minimum diameter spanning tree
Recommended article: A fully distributed (minimal) spanning tree algorithm
Recommended article: A distributed algorithm for directed minimum-weight spanning tree
description: scientific article; zbMATH DE number 983277