The generalized diameter of a graph
Chih‐Kang Eric Chen, Robert Garfinkel · Networks · 1982
Abstract We generalize the concept of the diameter of a graph G = (N, A) to allow for location of points not on the nodes. It is shown that there exists a finite set of candidate points which determine this generalized diameter. Given the matrix of shortest paths, an o (|A|2) algorithm is developed and tested.