Speeding up algorithms on compressed web graphs

DOI10.1080/15427951.2009.10390646MaRDI QIDQ5388292zbMATH OpenOpenAlexFDO

Authors C. Karande, Kumar Chellapilla, Reid Andersen

Publication date 18 April 2012

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.im/1318269503

zbMATH Keywords

compressed web graphsweb graph algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Tight and simple web graph compression for forward and reverse neighbor queries
• Graph compression by BFS
• Efficient Compression of Web Graphs
• Extended compact web graph representations
• Fast construction of compressed web graphs

Cited in

(13)

• Graph compression by BFS
• Data compression in big graph warehouse
• Reachability preserving compression for dynamic graph
• Parallel maximum clique algorithms with applications to network analysis
• Efficient Compression of Web Graphs
• Extended compact web graph representations
• scientific article; zbMATH DE number 1555964 (Why is no real title available?)
• Tight and simple web graph compression for forward and reverse neighbor queries
• Fast construction of compressed web graphs
• Permuting web and social graphs
• Models for the Compressible Web
• Faster compression methods for a weighted graph using locality sensitive hashing
• Complex network filtering and compression algorithm based on triangle-subgraph

Describes a project that uses

Uses Software

• UbiCrawler

This page was built for publication: Speeding up algorithms on compressed web graphs

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