Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference5 articles.
1. J. Ernvall,On the construction of spanning paths by Gray-code, Univ. of Turku, Finland, manuscript 1980.
2. J. Ernvall and O. Nevalainen,Compact storage schemes for formatted files by spanning trees, BIT 19 (1979), pp. 463–475.
3. J. Ernvall and O. Nevalainen,Estimating the length of minimal spanning trees in compression of files, Report B32, Univ. of Turku, 1983.
4. E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms, Pitman, 1978.
5. A. N. C. Kang, R. C. T. Lee, C. L. Chang and S. K. Chang,Storage reduction through minimal spanning trees and spanning forests, IEEE Trans. on Computers, Vol. C-26, No. 5 (1977).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献