Tight and simple web graph compression for forward and reverse neighbor queries
DOI10.1016/J.DAM.2013.05.028zbMATH Open1329.68046OpenAlexW2036866367MaRDI QIDQ496546FDOQ496546
Authors: Szymon Grabowski, Wojciech Bieniecki 
Publication date: 22 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.05.028
Recommendations
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)
Cites Work
- Compressed representations of sequences and full-text indexes
- Graph compression by BFS
- Permuting web and social graphs
- Extended compact web graph representations
- A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
- Efficient Compression of Web Graphs
- New word-based adaptive dense compressors
- Combinatorial Pattern Matching
Cited In (11)
- 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
- Title not available (Why is that?)
- Graph compression by BFS
- Permuting web and social graphs
- Speeding up algorithms on compressed web graphs
- Extended compact web graph representations
- Title not available (Why is that?)
- Reachability preserving compression for dynamic graph
Uses Software
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)
