Storage Reduction Through Minimal Spanning Trees and Spanning Forests

DOI10.1109/TC.1977.1674859zbMATH Open0352.68043OpenAlexW2132927780MaRDI QIDQ4122780FDOQ4122780

Authors: Andy N. C. Kang, Chinliang Chang, Shi-Kuo Chang, R. C. T. 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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cited In (6)

• The central limit theorem for Euclidean minimal spanning trees. I
• Compact storage schemes for formatted files by spanning trees
• Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
• The random minimal spanning tree in high dimensions
• Data compression and Gray-code sorting
• Estimating the length of minimal spanning trees in compression of files

This page was built for publication: Storage Reduction Through Minimal Spanning Trees and Spanning Forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4122780)