Tight and simple web graph compression for forward and reverse neighbor queries (Q496546): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Graph compression by BFS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Compression of Web Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permuting Web and Social Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Compact Web Graph Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed representations of sequences and full-text indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Word-Based Adaptive Dense Compressors / rank
 
Normal rank

Revision as of 18:50, 10 July 2024

scientific article
Language Label Description Also known as
English
Tight and simple web graph compression for forward and reverse neighbor queries
scientific article

    Statements

    Tight and simple web graph compression for forward and reverse neighbor queries (English)
    0 references
    0 references
    0 references
    22 September 2015
    0 references
    graph compression
    0 references
    random access
    0 references
    bidirectional neighbor queries
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references