Graph compression by BFS

DOI10.3390/A2031031MaRDI QIDQ1662490zbMATHOpenAlexFDO

Authors Alberto Apostolico, Guido Drovandi

Publication date 20 August 2018

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

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)

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

Cites work

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

Cited in

(18)

• Summarizing and understanding large graphs
• Compressing Bounded Degree Graphs
• Efficient Compression of Web Graphs
• Tight and simple web graph compression for forward and reverse neighbor queries
• Speeding up algorithms on compressed web graphs
• Compact structure for sparse undirected graphs based on a clique graph partition
• Multiscale approach for the network compression-friendly ordering
• Faster compression methods for a weighted graph using locality sensitive hashing
• Simple efficient graph compression schemes for dense and complement graphs
• Linearity is strictly more powerful than contiguity for encoding graphs
• Complex network filtering and compression algorithm based on triangle-subgraph
• Linearity is strictly more powerful than contiguity for encoding graphs
• Data compression in big graph warehouse
• scientific article; zbMATH DE number 1555964 (Why is no real title available?)
• Permuting web and social graphs
• Fast construction of compressed web graphs
• Extended compact web graph representations
• scientific article; zbMATH DE number 1930132 (Why is no real title available?)

Describes a project that uses

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)