Models for the Compressible Web

DOI10.1137/120879828MaRDI QIDQ5396946zbMATH OpenOpenAlexFDO

Authors Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan

Publication date 4 February 2014

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/1f70da85e740ab5885a691f522467ea13d5a3a00

zbMATH Keywords

graph compressionheavy-tailed distributionsweb graph models

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coding theorems (Shannon theory) (94A24)

Recommendations

• Models for the Compressible Web
• Efficient Compression of Web Graphs
• Fast construction of compressed web graphs
• An abstract model for compressions
• Speeding up algorithms on compressed web graphs
• scientific article; zbMATH DE number 2088902
• Tight and simple web graph compression for forward and reverse neighbor queries
• Extended compact web graph representations

Cited in

(2)

• The concentration of the maximum degree in the duplication-divergence models
• On the Concentration of the Maximum Degree in the Duplication-Divergence Models

This page was built for publication: Models for the Compressible Web

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