This produces a binary tree T , in which each node corresponds to a subset of points contained in some 5 d dimensional box. As we have already seen, it is possible for planar sites to construct small dilation graphs with weight arbitrarily close to that of the minimum spanning tree. Constructing multidimensional spanner graphs . Int. J. Comp. In this paper, we show that it is possible to incorporate fault tolerance into such networks.
Fault tolerance is intimately related to the graph theoretic concept of connectivity.
J. S. Salowe. Constructing multidimensional spanner graphs . Their algorithms are related and use hierarchical subdivisions. Constructing multidimensional spanner graphs . 2LS, United Kingdom.