Estimating the length of minimal spanning trees in compression of files

DOI10.1007/BF01934512zbMATH Open0528.68042OpenAlexW2006135948MaRDI QIDQ786537FDOQ786537

Authors: 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

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

Cites Work

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

Cited In (1)

• Estimating the length of minimal spanning trees in compression of files

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

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