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

DOI10.1007/s11590-019-01399-9zbMath1442.90171OpenAlexW2922434999WikidataQ128250584 ScholiaQ128250584MaRDI QIDQ2174897

Juggapong Natwichai, Wanpracha Art Chaovalitwongse, Sumalee Sangamuang, Pruet Boonma

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

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

Related Items (1)

Partitioning \(P_4\)-tidy graphs into a stable set and a forest

Uses Software

• SNAP

Cites Work

• Balanced graph partitioning
• 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
• Unnamed Item
• Unnamed Item

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