This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Storage Reduction Through Minimal Spanning Trees and Spanning Forests
May 1977 (vol. 26 no. 5)
pp. 425-434
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
Usage of this product signifies your acceptance of the Terms of Use.