The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1977 vol.26)
pp: 425-434
A.N.C. Kang , Bell Laboratories
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.
INDEX TERMS
Analysis of algorithms, memory storage reduction, minimal spanning trees, spanning forests.
CITATION
A.N.C. Kang, R.C.T. Lee, null Chin-Liang Chang, null Shi-Kuo Chang, "Storage Reduction Through Minimal Spanning Trees and Spanning Forests", IEEE Transactions on Computers, vol.26, no. 5, pp. 425-434, May 1977, doi:10.1109/TC.1977.1674859
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool