Compact storage schemes for formatted files by spanning trees (Q3851615): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for updating minimal spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storage Reduction Through Minimal Spanning Trees and Spanning Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum distance<tex>q</tex>-nary codes / rank
 
Normal rank

Latest revision as of 02:28, 13 June 2024

scientific article
Language Label Description Also known as
English
Compact storage schemes for formatted files by spanning trees
scientific article

    Statements

    Compact storage schemes for formatted files by spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    1979
    0 references
    compact storage schemes
    0 references
    spanning trees
    0 references
    compression of data files
    0 references
    Hamming-distance
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references