Various graphs such as web or social networks may contain up to trillions of edges.
Compressing such datasets can accelerate graph processing by reducing the amount of I/O …

We propose new succinct representations of ordinal trees and match various space/time
lower bounds. It is known that any n-node static tree can be represented in 2 n+ o (n) bits so …

This paper presents a Web graph representation based on a compact tree structure that
takes advantage of large empty areas of the adjacency matrix of the graph. Our results show …

Consider an ordered, static tree T where each node has a label from alphabet Σ. Tree T may
be of arbitrary degree and shape. Our goal is designing a compressed storage scheme of T …

We present a practical study on the compact representation of sequences supporting rank,
select, and access queries. While there are several theoretical solutions to the problem, only …

From sensor networks to transportation infrastructure to social networks, we are awash in
data. Many of these real-world networks tend to be large (“big data”) and dynamic, evolving …

Self-indexes are able to represent a text asymptotically within the information-theoretic lower
bound under the k th order entropy model and offer access to any text substring and indexed …

We propose a storage scheme for a string S [1, n], drawn from an alphabet Σ, that requires
space close to the k-th order empirical entropy of S, and allows one to retrieve any substring …

The wavelet tree is a flexible data structure that permits representing sequences S [1, n] of
symbols over an alphabet of size σ, within compressed space and supporting a wide range …

Compressed graph representations, in particular for Web graphs, have become an attractive
research topic because of their applications in the manipulation of huge graphs in main …