Storage Reduction Through Minimal Spanning Trees and Spanning Forests

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.

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  James R. Slagle,et al.  A Clustering and Data-Reorganizing Algorithm , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  J A Rinaldo,et al.  Symptom diagnosis: a comparison of mathematical models related to upper abdominal pain. , 1968, Computers and biomedical research, an international journal.

[4]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[5]  Richard C. T. Lee,et al.  Experiments with some cluster analysis algorithms , 1974, Pattern Recognit..

[6]  J. Hartigan.  Direct Clustering of a Data Matrix , 1972 .

[7]  Andy N. C. Kang,et al.  Some Properties of a Centroid of a Free Tree , 1975, Inf. Process. Lett..

[8]  M. O. Dayhoff.  Computer analysis of protein evolution. , 1969, Scientific American.

[9]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..