Storage Reduction Through Minimal Spanning Trees and Spanning Forests
- 1 May 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-26 (5) , 425-434
- https://doi.org/10.1109/tc.1977.1674859
Abstract
It is often possible to save storage space in a computer by storing only the differences among data items rather than the entire items. For example, suppose we have two records A and B. We should store all of A, then for B store a pointer to A and the differences between A and B. If A and B are similar, there will be few differences and storage space can be saved.Keywords
This publication has 9 references indexed in Scilit:
- Some properties of a centroid of a free treeInformation Processing Letters, 1975
- A Clustering and Data-Reorganizing AlgorithmIEEE Transactions on Systems, Man, and Cybernetics, 1975
- Experiments with some cluster analysis algorithmsPattern Recognition, 1974
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Direct Clustering of a Data MatrixJournal of the American Statistical Association, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Computer Analysis of Protein EvolutionScientific American, 1969
- Symptom diagnosis: A comparison of mathematical models related to upper abdominal painComputers and Biomedical Research, 1968
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957