Codes for the World Wide Web

DOI10.1080/15427951.2005.10129113MaRDI QIDQ5491967zbMATH OpenOpenAlexFDO

Authors Paolo Boldi, Sebastiano Vigna

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)

Recommendations

• Codes
• scientific article; zbMATH DE number 874557
• scientific article; zbMATH DE number 1028232
• scientific article; zbMATH DE number 863485
• scientific article; zbMATH DE number 946419
• Network codes
• Nets and their codes

Cited in

(11)

• Graph compression by BFS
• Adaptive succinctness
• Linearity is strictly more powerful than contiguity for encoding graphs
• Compact indexes for flexible top-k
• Parallel maximum clique algorithms with applications to network analysis
• Linearity is strictly more powerful than contiguity for encoding graphs
• (Nearly-)tight bounds on the contiguity and linearity of cographs
• Sublinear column-wise actions of the matrix exponential on social networks
• Efficient semi-external depth-first search
• Binary codes for locally homogeneous sequences
• Main-memory triangle computations for very large (sparse (power-law)) graphs

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

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