Abstract
A special clustering problem is discussed in this paper, called the compact set problem. The goal of the problem is to find all compact sets in a complete, weighted, undirected graph withn vertices. A subsetC of vertices is called a compact set if 1<|C|<n and the maximum weight among all edges inC is smaller than the minimum weight among all edges connecting one vertex inC and the other vertex not inC. An algorithm with complexityO(n 2) is given for the problem improving the previous results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Even,Graph Algorithms, Computer Science Press, Rockville, Maryland, 1987.
J. B. Jr. Kruskal,On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society, Vol. 7, No. 1, 1956, pp. 48–50.
R. C. Prim,Shortest connection networks and some generalizations, Bell System Technical Journal, 1957, pp. 1389–1401.
R. E. Tarjan,Sensitivity analysis of minimal spanning trees and shortest path trees, Information Processing Letters, Vol. 14, No. 1, 1982, pp. 30–33.
R. E. Tarjan,Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, 1983.
D. Zivkovic,A fast algorithm for finding the compact sets, Information Processing Letters, Vol. 38, No. 6, 1991, pp. 339–342.
Author information
Authors and Affiliations
Additional information
This research was partially supported by the National Science Council of the Republic of China under Grant NSC81-0408-E-216-502.
Rights and permissions
About this article
Cite this article
Liang, CK. AnO(n 2) algorithm for finding the compact sets of a graph. BIT 33, 390–395 (1993). https://doi.org/10.1007/BF01990522
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01990522