MAD trees and distance-hereditary graphs

被引:7
|
作者
Datilhaus, E
Dankelmann, P
Goddard, W [1 ]
Swart, HC
机构
[1] Univ Natal, Dept Comp Sci, ZA-4041 Durban, South Africa
[2] Tech Univ Vienna, Inst Comp Graph, A-1060 Vienna, Austria
[3] Univ Natal, Sch Math & Stat Sci, ZA-4001 Durban, South Africa
关键词
distance; spanning tree; minimum average distance; distance-hereditary graphs;
D O I
10.1016/S0166-218X(02)00422-5
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
For a graph G with weight function w on the vertices, the total distance of G is the sum over all unordered pairs of vertices x and y of w(x)w(y) times the distance between x and y. A MAD tree of G is a spanning tree with minimum total distance. We develop a linear-time algorithm to find a MAD tree of a distance-hereditary graph; that is, those graphs where distances are preserved in every connected induced subgraph. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:151 / 167
页数:17
相关论文
共 50 条