Tight and simple web graph compression for forward and reverse neighbor queries

DOI10.1016/J.DAM.2013.05.028zbMath1329.68046OpenAlexW2036866367MaRDI QIDQ496546

Wojciech Bieniecki, Szymon Grabowski

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

zbMATH Keywords

graph compressionrandom accessbidirectional neighbor queries

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Information storage and retrieval of data (68P20) Internet topics (68M11)

Uses Software

• UbiCrawler
• WebGraph

Cites Work

• Graph compression by BFS
• Compressed representations of sequences and full-text indexes
• Efficient Compression of Web Graphs
• Extended Compact Web Graph Representations
• New Word-Based Adaptive Dense Compressors
• A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
• Combinatorial Pattern Matching
• Permuting Web and Social Graphs

This page was built for publication: Tight and simple web graph compression for forward and reverse neighbor queries