UbiCrawler

swMATH13197MaRDI QIDQ25113FDOQ25113

Author name not available (Why is that?)

Official website: http://dl.acm.org/citation.cfm?id=1045969

Cited In (51)

• Performance Modeling of a Distributed Web Crawler Using Stochastic Activity Networks
• Steady-state analysis of google-like stochastic matrices with block iterative methods
• Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model
• Algorithms and Models for the Web-Graph
• Off-diagonal low-rank preconditioner for difficult PageRank problems
• Fast construction of compressed web graphs
• Main-memory triangle computations for very large (sparse (power-law)) graphs
• Fast quasi-threshold editing
• Parallel maximum clique algorithms with applications to network analysis
• On the bit-complexity of Lempel-Ziv compression
• Lempel-Ziv-78 compressed string dictionaries
• Complex network partitioning using label propagation
• GLOUDS: representing tree-like graphs
• Theory and practice of monotone minimal perfect hashing
• Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds
• Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors
• Computing strongly connected components in the streaming model
• LiveRank: how to refresh old datasets
• Graph compression by BFS
• An efficient elimination strategy for solving PageRank problems
• Perturbed iterate analysis for asynchronous stochastic optimization
• MCSTL
• STXXL
• Speeding up algorithms on compressed web graphs
• ANF
• Graphs
• MetExplore
• Mercator
• UMPa
• bvgraph
• LUBM
• Lightweight data indexing and compression in external memory
• KronFit
• libcds
• SDSL
• BUbiNG
• succinct
• WebGraph
• DYNAMIC
• Sux4J
• GraphChi
• NetworKit
• Practical acceleration for computing the HITS expertrank vectors
• Practical implementation of space-efficient dynamic keyword dictionaries
• Tight and simple web graph compression for forward and reverse neighbor queries
• Fast compressed tries through path decompositions
• Counting triangles in massive graphs with MapReduce
• On computing the diameter of real-world undirected graphs
• A partitioning-based divisive clustering technique for maximizing the modularity
• Traps and Pitfalls of Topic-Biased PageRank
• Optimization issues in web search engines

This page was built for software: UbiCrawler