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

DOI10.1007/S11590-019-01399-9zbMATH Open1442.90171OpenAlexW2922434999WikidataQ128250584 ScholiaQ128250584MaRDI QIDQ2174897FDOQ2174897

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

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

zbMATH Keywords

graph partitioningheuristic searchpagerankmixed integer program

Mathematics Subject Classification ID

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

Cites Work

• Balanced graph partitioning
• Authoritative sources in a hyperlinked environment
• A polylogarithmic approximation of the minimum bisection
• A mixed-integer programming approach to the clustering problem with an application in customer segmentation
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

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

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)