Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking
© 2019, Springer-Verlag GmbH Germany, part of Springer Nature. This paper presents a new mathematical programming model and a solution approach for a special class of graph partitioning problem. The problem studied here is in the context of distributed web search, in which a very large world-wide-we...
Saved in:
Main Authors: | Sumalee Sangamuang, Pruet Boonma, Juggapong Natwichai, Wanpracha Art Chaovalitwongse |
---|---|
Format: | Journal |
Published: |
2019
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85062696480&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/63686 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
An algorithm for min-cut density-balanced partitioning in P2P web ranking
by: Sumalee Sangamuang, et al.
Published: (2018) -
An algorithm for min-cut density-balanced partitioning in P2P web ranking
by: Sumalee Sangamuang, et al.
Published: (2018) -
IDBP: A distributed min-cut density-balanced algorithm for incremental web-pages ranking
by: Sumalee Sangamuang, et al.
Published: (2020) -
An efficient algorithm for density-balanced partitioning in distributed pagerank
by: Sumalee Sangamuang, et al.
Published: (2018) -
An efficient algorithm for density-balanced partitioning in distributed pagerank
by: Sumalee Sangamuang, et al.
Published: (2018)