Tight and simple web graph compression for forward and reverse neighbor queries
From MaRDI portal
(Redirected from Publication:496546)
Internet topics (68M11) Data structures (68P05) Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Graph theory (including graph drawing) in computer science (68R10)
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)- Graph compression by BFS
- Compact structure for sparse undirected graphs based on a clique graph partition
- Reachability preserving compression for dynamic graph
- Efficient Compression of Web Graphs
- Extended compact web graph representations
- scientific article; zbMATH DE number 1555964 (Why is no real title available?)
- scientific article; zbMATH DE number 1930132 (Why is no real title available?)
- Fast construction of compressed web graphs
- Permuting web and social graphs
- Speeding up algorithms on compressed web graphs
- Models for the Compressible Web
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)
