A linear algorithm for centering a spanning tree of a biconnected graph

Date Issued
10-08-1994
Author(s)
Easwarakumar, K. S.
Indian Institute of Technology, Madras
Cheston, G. A.
DOI
Abstract
We present a linear-time algorithm for finding a spanning tree of a biconnected graph with a given vertex as its center. © 1994.
Volume
51
Subjects