Permuting Web and Social Graphs
From MaRDI portal
Publication:5388287
DOI10.1080/15427951.2009.10390641zbMath1235.68035MaRDI 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
Related Items
Linearity is strictly more powerful than contiguity for encoding graphs, Tight and simple web graph compression for forward and reverse neighbor queries, Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs