A linear-time algorithm to compute a MAD tree of an interval graph

Abstract

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. 
DOI: 10.1016/j.ipl.2003.11.009

Topics

  • Presentations referencing similar topics