Compact storage schemes for formatted files by spanning trees

DOI10.1007/BF01931262zbMath0418.68039MaRDI QIDQ3851615

Olli S. Nevalainen, Jarmo Ernvall

Publication date: 1979

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

spanning treesHamming-distancecompression of data filescompact storage schemes

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Algorithms for updating minimal spanning trees
• Storage Reduction Through Minimal Spanning Trees and Spanning Forests
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
• Maximum distance<tex>q</tex>-nary codes

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