Speeding Up Algorithms on Compressed Web Graphs

DOI10.1080/15427951.2009.10390646zbMath1235.68037OpenAlexW1994704968MaRDI QIDQ5388292

C. Karande, Reid Andersen, Kumar Chellapilla

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 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) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11)

Related Items (2)

Parallel Maximum Clique Algorithms with Applications to Network Analysis ⋮ Graph compression by BFS

Uses Software

• UbiCrawler

This page was built for publication: Speeding Up Algorithms on Compressed Web Graphs