Distributed PageRank computation with improved round complexities (Q6195176): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2022.05.108 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4281639610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed PageRank computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating PageRank on graph streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of the congested clique model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Optimal Bounds in the Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: MST in Log-Star Rounds of Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal deterministic routing and sorting on the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computation of Large-scale Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lessons from the congested clique applied to MapReduce / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walking randomly, massively, and efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distributed random walks with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hessenberg-type algorithm for computing PageRank problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient elimination strategy for solving PageRank problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the Power-Arnoldi algorithm for computing PageRank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive Proofs of Concentration Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of a scale-free random graph / rank
 
Normal rank

Latest revision as of 10:39, 28 August 2024

scientific article; zbMATH DE number 7816900
Language Label Description Also known as
English
Distributed PageRank computation with improved round complexities
scientific article; zbMATH DE number 7816900

    Statements

    Distributed PageRank computation with improved round complexities (English)
    0 references
    0 references
    0 references
    0 references
    13 March 2024
    0 references
    PageRank
    0 references
    distributed computation
    0 references
    graph
    0 references
    algorithms
    0 references

    Identifiers