On the complexity of the Monte Carlo method for incremental PageRank (Q2445397)
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: On the complexity of the Monte Carlo method for incremental PageRank |
scientific article; zbMATH DE number 6284425
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the Monte Carlo method for incremental PageRank |
scientific article; zbMATH DE number 6284425 |
Statements
On the complexity of the Monte Carlo method for incremental PageRank (English)
0 references
14 April 2014
0 references
analysis of algorithms
0 references
graph algorithms
0 references
Monte Carlo PageRank
0 references
0.7300230860710144
0 references
0.7241942882537842
0 references
0.7161188721656799
0 references
0.7137800455093384
0 references
0.7090549468994141
0 references
