An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC (Q275525)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC |
scientific article; zbMATH DE number 6573684
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC |
scientific article; zbMATH DE number 6573684 |
Statements
An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC (English)
0 references
26 April 2016
0 references
graph
0 references
Monte Carlo
0 references
PageRank
0 references
random walk
0 references
