Extended Compact Web Graph Representations

DOI10.1007/978-3-642-12476-1_5zbMath1284.68058OpenAlexW1582803813MaRDI QIDQ3558260

Francisco Claude, Gonzalo Navarro

Publication date: 4 May 2010

Published in: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12476-1_5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62) Internet topics (68M11)

Related Items (9)

Fast construction of wavelet trees ⋮ Compact binary relation representations with rich functionality ⋮ Wavelet trees for all ⋮ Efficient fully-compressed sequence representations ⋮ Tight and simple web graph compression for forward and reverse neighbor queries ⋮ Fast Construction of Compressed Web Graphs ⋮ Compact structure for sparse undirected graphs based on a clique graph partition ⋮ Locally Compressed Suffix Arrays ⋮ Fast Compressed Tries through Path Decompositions

This page was built for publication: Extended Compact Web Graph Representations