Storage Reduction Through Minimal Spanning Trees and Spanning Forests
From MaRDI portal
Publication:4122780
DOI10.1109/TC.1977.1674859zbMath0352.68043OpenAlexW2132927780MaRDI QIDQ4122780
Chinliang Chang, Andy N. C. Kang, Shi-Kuo Chang, Richard Chia-Tung Lee
Publication date: 1977
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1977.1674859
Formal languages and automata (68Q45) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
Data compression and Gray-code sorting, Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems, The central limit theorem for Euclidean minimal spanning trees. I, The random minimal spanning tree in high dimensions, Compact storage schemes for formatted files by spanning trees, Estimating the length of minimal spanning trees in compression of files
