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