Compact storage schemes for formatted files by spanning trees

DOI10.1007/BF01931262MaRDI QIDQ3851615zbMATH OpenFDO

Authors Jarmo Ernvall, Olli S. Nevalainen

Publication date 1979

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01931262

zbMATH Keywords

compact storage schemescompression of data filesHamming-distancespanning trees

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Algorithms for updating minimal spanning trees
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Maximum distance<tex>q</tex>-nary codes
• Storage Reduction Through Minimal Spanning Trees and Spanning Forests

Cited in

(3)

• Data compression and Gray-code sorting
• NP-completeness of the Hamming salesman problem
• Estimating the length of minimal spanning trees in compression of files

This page was built for publication: Compact storage schemes for formatted files by spanning trees

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