A Linear-time Algorithm to Compute a MAD Tree of an Interval Graph
journal contributionposted on 01.06.1979 by Elias Dahlhaus, Peter Dankelmann, Ramamoorthi Ravi
Any type of content formally published in an academic journal, usually following a peer-review process.
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.