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