Algorithm 479: A minimal spanning tree clustering method
- 1 June 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 17 (6) , 321-323
- https://doi.org/10.1145/355616.355617
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Occupancy of a rectangular arrayThe Computer Journal, 1973
- Implementing Clenshaw-Curtis quadrature, I methodology and experienceCommunications of the ACM, 1972
- Algorithm 422: minimal spanning tree [H]Communications of the ACM, 1972
- Graph-Theoretical Methods for Detecting and Describing Gestalt ClustersIEEE Transactions on Computers, 1971
- A comparison of some numerical integration programsACM SIGNUM Newsletter, 1969