Results 1 
2 of
2
A Probabilistic Minimum Spanning Tree Algorithm
 Information Processing Letters
, 1978
"... This paper is concerned with the problem of computing spanning tree (MST) for n points in a pdimensional space where the "distance" between each pair of points i and j satisfies the relationship' dq max {Ixti  xtql} , where xki is the coordinate of object i along the ktti dimensio ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
This paper is concerned with the problem of computing spanning tree (MST) for n points in a pdimensional space where the "distance" between each pair of points i and j satisfies the relationship' dq max {Ixti  xtql} , where xki is the coordinate of object i along the ktti dimension. This relationship is clearly satisfied by all Minkowski metrics dq = [ Ixki  xnjl r] x/r, r > 1