ALGORITHM ON SOME SHORTEST PATH OF DENDROGRAM
Shaoheng Wang · Journal of Mathematics · 2009
In this paper,the edge and vertex weighted graph,the transportation capacity of vertex to the graph and centroid of the graph are introduced and studied.By comparing transportation capacity of two adjacent vertices,it obtains that a necessity and sufficiency condition is that a vertex of a graph is centroid and the number of the centroids of a graph is not greater than 2.In addition,the algorithm on finding the centroid and the minimal transportation capacity are derived,of whih its complexity is O(n2).It is conducive to solve the optimization problem,which can be made by dendrogram.