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

Authors:
Elias Dahlhaus;Peter Dankelmann;R. Ravi
Affiliations:
Department of Computer Science, University of Bonn, Bonn, Germany;School of Mathematical and Statistical Sciences, University of Natal, Durban, South Africa;Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA
Venue:
Information Processing Letters
Year:
2004

Citing 5
Cited 1

Computing the average distance of an interval graph

Information Processing Letters
Extremal values for ratios of distances in trees

Discrete Applied Mathematics - Special issue: 50th anniversary of the Wiener index
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

SIAM Journal on Computing
Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals

IEEE Transactions on Parallel and Distributed Systems
MAD Trees and distance-hereditary graphs

Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"

On the intercluster distance of a tree metric

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

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.