An Efficient Algorithm for Computation of a Minimum Average Distance Tree on Trapezoid Graphs
Sukumar Mondal · Journal of Scientific Research and Reports · 2013
The average distance μ(G) of a finite graph G = (V, E) is the average of the distances over all unordered pairs of vertices which can be used as a tool in analytic networks where the performance time is proportional to the distance between any two nodes. A minimum average distanc...
Open access
Research Article
10.9734/JSRR/2013/4661