C Pandu Rangan

Department of Computer Science and Engineering

Data processing

Distributed computer systems

Graph theory

Linear algebra

Number theory

Real time systems

Set theory

Trees (mathematics)

Biconnected graph

Eccentricity

LINEAR TIME ALGORITHMS

SPANNING TREE

Algorithms

IIT Madras is a public technical and research university located in Chennai, Tamil Nadu. Founded in 1959, it is recognised as an Institute of National Importance.

IIT Madras has been ranked as the top engineering institute in India for four years in a row by the National Institutional Ranking Framework of the MHRD

It currently offers undergraduate, postgraduate and research degrees across 16 disciplines in Engineering, Sciences, Humanities and Management. About 596 faculty belonging to science and engineering departments and centres of the Institute are engaged in teaching, research and industrial consultancy.

IIT Madras

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

Information Processing Letters

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.

An efficient distributed algorithm for centering a spanning tree of a reconnected graph

Hassler Whitney Collected Papers

Non-Separable and Planar Graphs

Centering a spanning tree of a biconnected graph

Theoretical Computer Science

Computing an st-numbering

Bulletin of the American Mathematical Society

Miscellaneous back pages, Bull. Amer. Math. Soc., Volume 38, Number 2 (1932)

Journal	Information Processing Letters
ISSN	00200190
Open Access	No