Compact storage schemes for formatted files by spanning trees
- 1 December 1979
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 19 (4) , 463-475
- https://doi.org/10.1007/bf01931262
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Algorithms for updating minimal spanning treesJournal of Computer and System Sciences, 1978
- Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate SpacesIEEE Transactions on Computers, 1978
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977
- Storage Reduction Through Minimal Spanning Trees and Spanning ForestsIEEE Transactions on Computers, 1977
- A classification of compression methods and their usefulness for a large data processing centerPublished by Association for Computing Machinery (ACM) ,1975
- Space and time savings through large data base compression and dynamic restructuringProceedings of the IEEE, 1975
- Maximum distanceq-nary codesIEEE Transactions on Information Theory, 1964