Efficient Compression of Web Graphs

DOI10.1007/978-3-540-69733-6_1zbMath1148.68367OpenAlexW1840889575MaRDI QIDQ3511306

Yuya Miyawaki, Yasuhito Asano, Takao Nishizeki

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_1

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (3)

Graph compression by BFS ⋮ Tight and simple web graph compression for forward and reverse neighbor queries ⋮ Compact structure for sparse undirected graphs based on a clique graph partition

Cites Work

• Universal codeword sets and representations of the integers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Compression of Web Graphs