The Community for Technology Leaders
Green Image
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. Kang, n. Chin-Liang Chang, n. Shi-Kuo Chang and R. Lee, "Storage Reduction Through Minimal Spanning Trees and Spanning Forests," in IEEE Transactions on Computers, vol. 26, no. , pp. 425-434, 1977.
doi:10.1109/TC.1977.1674859
90 ms
(Ver 3.3 (11022016))