Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking

DOI10.1007/S11590-019-01399-9MaRDI QIDQ2174897zbMATH OpenOpenAlexWikidataFDO

Authors Sumalee Sangamuang, Pruet Boonma, Juggapong Natwichai, Wanpracha A. Chaovalitwongse

Publication date 27 April 2020

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-019-01399-9

zbMATH Keywords

graph partitioningheuristic searchpagerankmixed integer program

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• A Web Aggregation Approach for Distributed Randomized PageRank Algorithms
• Distributed randomized algorithms for PageRank computation: recent advances
• Distributed Randomized Algorithms for the PageRank Computation
• Fast distributed PageRank computation
• On the multi-splitting iteration method for computing PageRank
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
• Distributed Randomized PageRank Algorithm Based on Stochastic Approximation

Cites work

• scientific article; zbMATH DE number 2079318 (Why is no real title available?)
• scientific article; zbMATH DE number 6472641 (Why is no real title available?)
• A mixed-integer programming approach to the clustering problem with an application in customer segmentation
• A polylogarithmic approximation of the minimum bisection
• Authoritative sources in a hyperlinked environment
• Balanced graph partitioning

Cited in

(2)

• Distributed balanced partitioning via linear embedding
• Partitioning \(P_4\)-tidy graphs into a stable set and a forest

Describes a project that uses

Uses Software

• SNAP

This page was built for publication: Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174897)