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

• Published in: Information processing letters Vol. 51; no. 3; pp. 121 - 124
• Main Authors: Easwarakumar, K.S., Rangan, C.Pandu, Cheston, G.A.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 10.08.1994; Elsevier Science
• Subjects: Algorithmics. Computability. Computer arithmetics; Algorithms; Applied sciences; Biconnected graphs; Center; Computer science; control theory; systems; Exact sciences and technology; Information retrieval. Graph; Spanning tree; st-numbering; Theoretical computing; st-numbering; Center; Algorithms; Biconnected graphs; Spanning tree; Graph; Numbering; Algorithm

We present a linear-time algorithm for finding a spanning tree of a biconnected graph with a given vertex as its center.