An efficient distributed algorithm for centering a spanning tree of a biconnected graph.

An efficient distributed algorithm for centering a spanning tree of a biconnected graph.

Détails bibliographiques
Publié dans:Information processing letters. 59, 3 (1996).
Auteur principal: Aranha, R.F.M
Format: Article
Langue:English
Sujets:
Algorithms.
Distributed graph algorithms.
Biconnected graphs.
St-numbering.
Center.
Spanning tree.