A LINEAR ALGORITHM FOR CENTERING A SPANNING TREE OF A BICONNECTED GRAPH

Authors
EASWARAKUMAR KS RANGAN CP CHESTON GA
Citation
Ks. Easwarakumar et al., A LINEAR ALGORITHM FOR CENTERING A SPANNING TREE OF A BICONNECTED GRAPH, Information processing letters, 51(3), 1994, pp. 121-124
Citations number
5
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
51
Issue
3
Year of publication
1994
Pages
121 - 124
Database
ISI
SICI code
0020-0190(1994)51:3<121:ALAFCA>2.0.ZU;2-B
Abstract
We present a linear-time algorithm for finding a spanning tree of a bi connected graph with a given vertex as its center.