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.

Detalles Bibliográficos
Publicado en:Information processing letters. 59, 3 (1996).
Autor principal: Aranha, R.F.M
Formato: Artículo
Lenguaje:English
Materias:
Algorithms.
Distributed graph algorithms.
Biconnected graphs.
St-numbering.
Center.
Spanning tree.