Date of Original Version
Information Processing Letters Volume 89, Issue 5, 16 March 2004, Pages 255-259
Abstract or Table of Contents
The average distance of a connected graph G is the average of the distances between all pairs of vertices of G. We present a linear time algorithm that determines, for a given interval graph G, a spanning tree of G with minimum average distance (MAD tree). Such a tree is sometimes referred to as a minimum routing cost spanning tree.