An efficient distributed algorithm for centering a spanning tree of a biconnected graph
R. F. M. Aranha, Chandrasekharan Pandu Rangan · Information Processing Letters · 1996
Given a biconnected graph G with n vertices, m edges and a vertex r, the centering of a spanning tree problem asks for a spanning tree T of G with the given vertex r as center of T. In this paper we present an O(m) message complexity and O(n) time complexity distributed algorithm for centering a spanning tree of a biconnected graph.