Permuting Web and Social Graphs

DOI10.1080/15427951.2009.10390641zbMath1235.68035OpenAlexW2000851569MaRDI QIDQ5388287

Paolo Boldi, Sebastiano Vigna, Massimo Santini

Publication date: 18 April 2012

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.im/1318269498

zbMATH Keywords

web graphweb-graph compressionWebGraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Internet topics (68M11)

Related Items (4)

Linearity is strictly more powerful than contiguity for encoding graphs ⋮ Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs ⋮ Tight and simple web graph compression for forward and reverse neighbor queries ⋮ Graph summarization with quality guarantees

This page was built for publication: Permuting Web and Social Graphs