UbiCrawler
From MaRDI portal
Software:25113
No author found.
Related Items (32)
Off-diagonal low-rank preconditioner for difficult PageRank problems ⋮ Parallel Maximum Clique Algorithms with Applications to Network Analysis ⋮ Fast Quasi-Threshold Editing ⋮ GLOUDS: representing tree-like graphs ⋮ Graph compression by BFS ⋮ Counting Triangles in Massive Graphs with MapReduce ⋮ Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors ⋮ On computing the diameter of real-world undirected graphs ⋮ Perturbed Iterate Analysis for Asynchronous Stochastic Optimization ⋮ Lightweight data indexing and compression in external memory ⋮ Traps and Pitfalls of Topic-Biased PageRank ⋮ Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds ⋮ Practical acceleration for computing the HITS expertrank vectors ⋮ Steady-state analysis of google-like stochastic matrices with block iterative methods ⋮ Speeding Up Algorithms on Compressed Web Graphs ⋮ Computing Strongly Connected Components in the Streaming Model ⋮ An efficient elimination strategy for solving PageRank problems ⋮ Unnamed Item ⋮ Tight and simple web graph compression for forward and reverse neighbor queries ⋮ Fast Construction of Compressed Web Graphs ⋮ Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries ⋮ Unnamed Item ⋮ Theory and practice of monotone minimal perfect hashing ⋮ Main-memory triangle computations for very large (sparse (power-law)) graphs ⋮ Lempel-Ziv-78 compressed string dictionaries ⋮ Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model ⋮ Performance Modeling of a Distributed Web Crawler Using Stochastic Activity Networks ⋮ Fast Compressed Tries through Path Decompositions ⋮ Complex Network Partitioning Using Label Propagation ⋮ Algorithms and Models for the Web-Graph ⋮ LiveRank: How to Refresh Old Datasets ⋮ On the Bit-Complexity of Lempel--Ziv Compression
This page was built for software: UbiCrawler
