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}
}
  • Elias Dahlhaus, Peter Dankelmann, R. Ravi
  • Published 2004
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 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. 

    Citations

    Publications citing this paper.
    SHOWING 1-8 OF 8 CITATIONS

    On the intercluster distance of a tree metric

    • Bang Ye Wu
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 2006
    VIEW 1 EXCERPT
    CITES METHODS

    Clustered Trees with Minimum Inter-cluster Distance

    • Bang Ye Wu, Chen-Wan Lin
    • Computer Science, Mathematics
    • 2014 IEEE 17th International Conference on Computational Science and Engineering
    • 2014
    VIEW 1 EXCERPT
    CITES BACKGROUND

    Spanning Trees: A Survey

    VIEW 3 EXCERPTS
    CITES BACKGROUND

    On the minimum routing cost clustered tree problem

    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

    • D. S. Johnson, A.H.G.J.K. Lenstra
    • 1978
    VIEW 2 EXCERPTS

    Szekély, Extremal Values of Distances in Trees

    • C. A. Barefoot, L.A.R.C. Entringer
    • Discrete Applied Mathematics
    • 1997
    VIEW 3 EXCERPTS