Estimating the length of minimal spanning trees in compression of files

DOI10.1007/BF01934512zbMath0528.68042OpenAlexW2006135948MaRDI QIDQ786537

Jarmo Ernvall, Olli S. Nevalainen

Publication date: 1984

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

spanning treesfile organization24, 19-32 (1984)file compressionformated fileGray-code sequencesweighted undirected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (1)

Estimating the length of minimal spanning trees in compression of files

Cites Work

• Estimating the length of minimal spanning trees in compression of files
• Compact storage schemes for formatted files by spanning trees
• Storage Reduction Through Minimal Spanning Trees and Spanning Forests

This page was built for publication: Estimating the length of minimal spanning trees in compression of files