Codes for the World Wide Web

DOI10.1080/15427951.2005.10129113zbMath1101.94013OpenAlexW2043770080MaRDI QIDQ5491967

Sebastiano Vigna, Paolo Boldi

Publication date: 12 October 2006

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

Full work available at URL: https://doi.org/10.1080/15427951.2005.10129113

zbMATH Keywords

web-graph compression

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15) Source coding (94A29)

Related Items (10)

Linearity is strictly more powerful than contiguity for encoding graphs ⋮ Parallel Maximum Clique Algorithms with Applications to Network Analysis ⋮ Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs ⋮ Graph compression by BFS ⋮ Compact Indexes for Flexible Top-$$k$$ Retrieval ⋮ (Nearly-)tight bounds on the contiguity and linearity of cographs ⋮ Efficient semi-external depth-first search ⋮ Main-memory triangle computations for very large (sparse (power-law)) graphs ⋮ Sublinear Column-wise Actions of the Matrix Exponential on Social Networks ⋮ Adaptive succinctness

This page was built for publication: Codes for the World Wide Web