Tight and simple web graph compression for forward and reverse neighbor queries
From MaRDI portal
Publication:496546
Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Internet topics (68M11)
Recommendations
Cites work
- A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
- Combinatorial Pattern Matching
- Compressed representations of sequences and full-text indexes
- Efficient Compression of Web Graphs
- Extended compact web graph representations
- Graph compression by BFS
- New word-based adaptive dense compressors
- Permuting web and social graphs
Cited in
(11)- Reachability preserving compression for dynamic graph
- Fast construction of compressed web graphs
- Models for the Compressible Web
- Compact structure for sparse undirected graphs based on a clique graph partition
- Efficient Compression of Web Graphs
- scientific article; zbMATH DE number 1555964 (Why is no real title available?)
- Graph compression by BFS
- Permuting web and social graphs
- Speeding up algorithms on compressed web graphs
- Extended compact web graph representations
- scientific article; zbMATH DE number 1930132 (Why is no real title available?)
This page was built for publication: Tight and simple web graph compression for forward and reverse neighbor queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496546)
