Graph compression by BFS

DOI10.3390/A2031031zbMATH Open1461.68021OpenAlexW2018900730MaRDI QIDQ1662490FDOQ1662490

Authors: Alberto Apostolico, Guido Drovandi 

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a2031031

Recommendations

• Speeding up algorithms on compressed web graphs
• Tight and simple web graph compression for forward and reverse neighbor queries
• Efficient Compression of Web Graphs
• Extended compact web graph representations
• Permuting Web Graphs

zbMATH Keywords

breadth-first searchdata compressiongraph compressionweb graphuniversal codes

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Internet topics (68M11)

Cites Work

• Efficient Storage and Retrieval by Content and Address of Static Files
• Codes for the World Wide Web
• On the succinct representation of graphs
• Universal codeword sets and representations of the integers
• Clique partitions, graph compression and speeding-up algorithms
• Efficient Compression of Web Graphs
• Speeding up algorithms on compressed web graphs

Cited In (18)

• Multiscale approach for the network compression-friendly ordering
• Linearity is strictly more powerful than contiguity for encoding graphs
• Linearity is strictly more powerful than contiguity for encoding graphs
• Fast construction of compressed web graphs
• Compact structure for sparse undirected graphs based on a clique graph partition
• Efficient Compression of Web Graphs
• Summarizing and understanding large graphs
• Title not available (Why is that?)
• Permuting web and social graphs
• Speeding up algorithms on compressed web graphs
• Extended compact web graph representations
• Fast and compact planar embeddings
• Faster compression methods for a weighted graph using locality sensitive hashing
• Title not available (Why is that?)
• Tight and simple web graph compression for forward and reverse neighbor queries
• Complex network filtering and compression algorithm based on triangle-subgraph
• Data compression in big graph warehouse
• Compressing Bounded Degree Graphs

Uses Software

• UbiCrawler

This page was built for publication: Graph compression by BFS

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