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

@article{Dahlhaus2004ALA, title={A linear-time algorithm to compute a MAD tree of an interval graph}, author={Elias Dahlhaus and Peter Dankelmann and R. Ravi}, journal={Inf. Process. Lett.}, year={2004}, volume={89}, pages={255-259} }

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.

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-8 OF 8 CITATIONS

## On the intercluster distance of a tree metric

VIEW 1 EXCERPT

CITES METHODS

## Clustered Trees with Minimum Inter-cluster Distance

VIEW 1 EXCERPT

CITES BACKGROUND

## On the intercluster and inner-cluster distances of a tree

VIEW 1 EXCERPT

CITES METHODS

## Spanning Trees: A Survey

VIEW 3 EXCERPTS

CITES BACKGROUND

## A survey of the all-pairs shortest paths problem and its variants in graphs

VIEW 3 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

#### References

##### Publications referenced by this paper.

SHOWING 1-8 OF 8 REFERENCES

## Computing the Average Distance of an Interval Graph

VIEW 2 EXCERPTS

## MAD trees and distance-hereditary graphs

VIEW 1 EXCERPT

## Rinnooy-Kan, The complexity of the network design problem. Networks

VIEW 2 EXCERPTS

## Szekély, Extremal Values of Distances in Trees

VIEW 3 EXCERPTS