A parallel pagerank algorithm for undirected graph (Q6095043)
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: A parallel pagerank algorithm for undirected graph |
scientific article; zbMATH DE number 7748294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel pagerank algorithm for undirected graph |
scientific article; zbMATH DE number 7748294 |
Statements
A parallel pagerank algorithm for undirected graph (English)
0 references
11 October 2023
0 references
pagerank
0 references
undirected graph
0 references
Chebyshev polynomial
0 references
parallel
0 references
0.9348973
0 references
0.89157856
0 references
0.88521445
0 references
0.8840592
0 references
0 references
0.8826726
0 references
0.88244975
0 references
