{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:54:58Z","timestamp":1742954098948,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031409776"},{"type":"electronic","value":"9783031409783"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-40978-3_5","type":"book-chapter","created":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T05:01:33Z","timestamp":1692766893000},"page":"42-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Empirical Study on\u00a0Min-Max External Ties to\u00a0Improve Decentralized Social Graph Ranking Performance"],"prefix":"10.1007","author":[{"given":"Sumalee","family":"Sangamuang","sequence":"first","affiliation":[]},{"given":"Thepparit","family":"Sinthamrongruk","sequence":"additional","affiliation":[]},{"given":"Waranya","family":"Mahanan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,24]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Bourse, F., Lelarge, M., Vojnovic, M.: Balanced graph edge partition. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2014, pp. 1456\u20131465. ACM, New York (2014)","DOI":"10.1145\/2623330.2623660"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Charalambous, T., Hadjicostis, C.N., Rabbat, M.G., Johansson, M.: Totally asynchronous distributed estimation of eigenvector centrality in digraphs with application to the pagerank problem. In: 2016 IEEE 55th Conference on Decision and Control (CDC), pp. 25\u201330 (2016). https:\/\/doi.org\/10.1109\/CDC.2016.7798241","DOI":"10.1109\/CDC.2016.7798241"},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1137\/S0097539701387660","volume":"31","author":"U Feige","year":"2002","unstructured":"Feige, U., Krauthgamer, R.: A polylogarithmic approximation of the minimum bisection. SIAM J. Comput. 31(4), 1090\u20131118 (2002)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.socnet.2013.09.002","volume":"35","author":"R Figueiredo","year":"2013","unstructured":"Figueiredo, R., Moura, G.: Mixed integer programming formulations for clustering problems related to structural balance. Soc. Netw. 35(4), 639\u2013651 (2013)","journal-title":"Soc. Netw."},{"key":"5_CR5","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970). https:\/\/doi.org\/10.1002\/j.1538-7305.1970.tb01770.x","journal-title":"Bell Syst. Tech. J."},{"issue":"5","key":"5_CR7","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604\u2013632 (1999)","journal-title":"J. ACM"},{"key":"5_CR8","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"issue":"5","key":"5_CR9","doi-asserted-by":"publisher","first-page":"2304","DOI":"10.1109\/TAC.2020.3004788","volume":"66","author":"E Montijano","year":"2021","unstructured":"Montijano, E., Oliva, G., Gasparri, A.: Distributed estimation and control of node centrality in undirected asymmetric networks. IEEE Trans. Autom. Control 66(5), 2304\u20132311 (2021). https:\/\/doi.org\/10.1109\/TAC.2020.3004788","journal-title":"IEEE Trans. Autom. Control"},{"key":"5_CR10","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University (1998)"},{"key":"5_CR11","unstructured":"Rozemberczki, B., Sarkar, R.: Twitch gamers: a dataset for evaluating proximity preserving and structural role-based node embeddings (2021)"},{"key":"5_CR12","series-title":"Lecture Notes on Data Engineering and Communications Technologies","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-02607-3_1","volume-title":"Advances on P2P, Parallel, Grid, Cloud and Internet Computing","author":"S Sangamuang","year":"2019","unstructured":"Sangamuang, S., Boonma, P., Natwichai, J.: iDBP: a distributed min-cut density-balanced algorithm for incremental web-pages ranking. In: Xhafa, F., Leu, F.-Y., Ficco, M., Yang, C.-T. (eds.) 3PGCIC 2018. LNDECT, vol. 24, pp. 3\u201313. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-02607-3_1"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1016\/j.ejor.2005.04.048","volume":"173","author":"B Sa\u011flam","year":"2006","unstructured":"Sa\u011flam, B., Salman, F.S., Say\u0131n, S., T\u00fcrkay, M.: A mixed-integer programming approach to the clustering problem with an application in customer segmentation. Eur. J. Oper. Res. 173(3), 866\u2013879 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Sumalee Sangamuang Pruet Boonma, J.N., Chaovalitwongse, W.A.: Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking. Optim. Lett. 14, 521\u2013533 (2020). https:\/\/doi.org\/10.1007\/s11590-019-01399-9","DOI":"10.1007\/s11590-019-01399-9"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Suzuki, A., Ishii, H.: Distributed randomized algorithms for pagerank based on a novel interpretation. In: 2018 Annual American Control Conference (ACC), pp. 472\u2013477 (2018). https:\/\/doi.org\/10.23919\/ACC.2018.8430939","DOI":"10.23919\/ACC.2018.8430939"},{"issue":"12","key":"5_CR16","doi-asserted-by":"publisher","first-page":"3255","DOI":"10.1109\/TAC.2013.2264553","volume":"58","author":"W Zhao","year":"2013","unstructured":"Zhao, W., Chen, H.F., Fang, H.T.: Convergence of distributed randomized pagerank algorithms. IEEE Trans. Autom. Control 58(12), 3255\u20133259 (2013). https:\/\/doi.org\/10.1109\/TAC.2013.2264553","journal-title":"IEEE Trans. Autom. Control"}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advances in Networked-based Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-40978-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T05:02:28Z","timestamp":1692766948000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40978-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031409776","9783031409783"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40978-3_5","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NBiS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Network-Based Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chiang Mai University","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nbis2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/voyager.ce.fit.ac.jp\/conf\/nbis\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}