Estimating the Length of Minimal Spanning Trees in Compression of Files.
Jarmo ErnvallOlli NevalainenPublished in: BIT (1984)
Keyphrases
- spanning tree
- edge disjoint
- total length
- minimal length
- minimum spanning tree
- minimum cost
- minimum spanning trees
- databases
- image compression
- data compression
- rigid body
- undirected graph
- file system
- compression ratio
- compression algorithm
- compression scheme
- random access
- depth first search
- root node
- file size
- shortest path
- graphical models