GeneRank
From MaRDI portal
Software:38783
swMATH27064MaRDI QIDQ38783FDOQ38783
Author name not available (Why is that?)
Cited In (16)
- Chebyshev acceleration of the GeneRank algorithm
- A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining
- An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC
- PageRank beyond the web
- Quantifying the multi-scale performance of network inference algorithms
- Polynomial preconditioning for the generank problem
- Walks: A Beginner's Guide to Graphs and Matrices
- A relaxed two-step splitting iteration method for computing PageRank
- An Arnoldi-extrapolation algorithm for computing pagerank
- Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
- A new extrapolation method for PageRank computations
- Fast computation of stationary joint probability distribution of sparse Markov chains
- On the multi-splitting iteration method for computing PageRank
- Title not available (Why is that?)
- Multilinear PageRank
- Learning to rank on graphs
This page was built for software: GeneRank
