Extended compact web graph representations

DOI10.1007/978-3-642-12476-1_5MaRDI QIDQ3558260zbMATH OpenOpenAlexFDO

Authors 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 representations (geometric and intersection representations, etc.) (05C62) Internet topics (68M11) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Tight and simple web graph compression for forward and reverse neighbor queries
• Graph compression by BFS
• Speeding up algorithms on compressed web graphs
• Fast construction of compressed web graphs
• scientific article; zbMATH DE number 1930132

Cited in

(13)

• Graph compression by BFS
• Compact structure for sparse undirected graphs based on a clique graph partition
• Wavelet trees for all
• Locally compressed suffix arrays
• Fast compressed tries through path decompositions
• Fast construction of wavelet trees
• Compact binary relation representations with rich functionality
• scientific article; zbMATH DE number 1930132 (Why is no real title available?)
• Efficient fully-compressed sequence representations
• Tight and simple web graph compression for forward and reverse neighbor queries
• Fast construction of compressed web graphs
• Speeding up algorithms on compressed web graphs
• Models for the Compressible Web

This page was built for publication: Extended compact web graph representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558260)