GeneRank
From MaRDI portal
Cited in
(30)- Polynomial preconditioning for the generank problem
- An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC
- A new extrapolation method for PageRank computations
- Chebyshev acceleration of the GeneRank algorithm
- Fast computation of stationary joint probability distribution of sparse Markov chains
- A relaxed two-step splitting iteration method for computing PageRank
- PageRank beyond the web
- On the multi-splitting iteration method for computing PageRank
- HBase
- CONTEST
- INGRES
- GraphBLAS
- TwitterRank
- Accumulo
- An Arnoldi-extrapolation algorithm for computing pagerank
- DynamoDB
- Learning to rank on graphs
- moleculaRnetworks
- P3S
- SNOBOL
- VisiCalc
- Vertica
- VoltDB
- GraphChi
- Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
- Multilinear PageRank
- Mathematics of big data. Spreadsheets, databases, matrices, and graphs. With a foreword by Charles E. Leiserson
- Quantifying the multi-scale performance of network inference algorithms
- Walks: a beginner's guide to graphs and matrices
- A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining
This page was built for software: GeneRank
