{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T18:40:16Z","timestamp":1759862416460,"version":"build-2065373602"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T00:00:00Z","timestamp":1759795200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T00:00:00Z","timestamp":1759795200000},"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":["J Supercomput"],"DOI":"10.1007\/s11227-025-07907-2","type":"journal-article","created":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T18:07:21Z","timestamp":1759860441000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed framework for high-quality graph partitioning"],"prefix":"10.1007","volume":"81","author":[{"given":"Chayma","family":"Sakouhi","sequence":"first","affiliation":[]},{"given":"Abir","family":"Khaldi","sequence":"additional","affiliation":[]},{"given":"Henda Ben","family":"Ghezala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,7]]},"reference":[{"key":"7907_CR1","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp 135\u2013146. ACM","DOI":"10.1145\/1807167.1807184"},{"key":"7907_CR2","unstructured":"Gonzalez JE, Low Y, Gu H, Bickson D, Guestrin C (2012) Powergraph: distributed graph-parallel computation on natural graphs. In: OSDI, vol. 12, p. 2"},{"key":"7907_CR3","unstructured":"Gonzalez JE, Xin RS, Dave A, Crankshaw D, Franklin MJ, Stoica I (2014) Graphx: Graph processing in a distributed dataflow framework. In: OSDI, vol. 14, pp. 599\u2013613"},{"issue":"2","key":"7907_CR4","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 BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(2):291\u2013307","journal-title":"Bell Syst Tech J"},{"key":"7907_CR5","doi-asserted-by":"crossref","unstructured":"Rahimian F, Payberah AH, Girdzijauskas S, Jelasity M, Haridi S (2013) Ja-be-ja: A distributed algorithm for balanced graph partitioning. In: 2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems, pp 51\u201360. IEEE","DOI":"10.1109\/SASO.2013.13"},{"key":"7907_CR6","doi-asserted-by":"crossref","unstructured":"Rahimian F, Payberah AH, Girdzijauskas S, Haridi S (2014) Distributed vertex-cut partitioning. In: IFIP International Conference on Distributed Applications and Interoperable Systems, pp. 186\u2013200. Springer","DOI":"10.1007\/978-3-662-43352-2_15"},{"issue":"2","key":"7907_CR7","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1137\/S0036144598334138","volume":"41","author":"G Karypis","year":"1999","unstructured":"Karypis G, Kumar V (1999) Parallel multilevel series k-way partitioning scheme for irregular graphs. SIAM Rev 41(2):278\u2013300","journal-title":"SIAM Rev"},{"key":"7907_CR8","unstructured":"Sanders P, Schulz C (2019) KaHIP\u2013Karlsruhe High Quality Partitioning. Accessed: Dec"},{"key":"7907_CR9","doi-asserted-by":"crossref","unstructured":"Tsourakakis C, Gkantsidis C, Radunovic B, Vojnovic M (2014) Fennel: Streaming graph partitioning for massive scale graphs. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining, pp 333\u2013342. ACM","DOI":"10.1145\/2556195.2556213"},{"key":"7907_CR10","doi-asserted-by":"crossref","unstructured":"Zhang W, Chen Y, Dai D (2018) Akin: a streaming graph partitioning algorithm for distributed graph storage systems. In: Proceedings of the 18th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing, pp 183\u2013192. IEEE Press","DOI":"10.1109\/CCGRID.2018.00033"},{"key":"7907_CR11","doi-asserted-by":"crossref","unstructured":"Patwary MAK, Garg S, Kang B (2019) Window-based streaming graph partitioning algorithm. In: Proceedings of the Australasian Computer Science Week Multiconference, p 51. ACM","DOI":"10.1145\/3290688.3290711"},{"key":"7907_CR12","doi-asserted-by":"crossref","unstructured":"Mayer C, Mayer R, Tariq MA, Geppert H, Laich L, Rieger L, Rothermel K (2018) Adwise: Adaptive window-based streaming edge partitioning for high-speed graph processing. In: 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), pp 685\u2013695. IEEE","DOI":"10.1109\/ICDCS.2018.00072"},{"key":"7907_CR13","unstructured":"Sakouhi C, Khaldi A, Ghezala HB (2018) Volume: Novel metric for graph partitioning. In: Proceedings of the International Conference on Information and Knowledge Engineering (IKE), pp. 174\u2013180. The Steering Committee of The World Congress in Computer Science, Computer"},{"key":"7907_CR14","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jpdc.2021.07.008","volume":"158","author":"C Sakouhi","year":"2021","unstructured":"Sakouhi C, Khaldi A, Ghezala HB (2021) Hammer lightweight graph partitioner based on graph data volumes. J Parallel Distrib Comput 158:16\u201328","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"7907_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Stockmeyer L (1976) Some simplified np-complete graph problems. Theoret Comput Sci 1(3):237\u2013267","journal-title":"Theoret Comput Sci"},{"issue":"28","key":"7907_CR16","first-page":"1","volume":"95","author":"B Hendrickson","year":"1995","unstructured":"Hendrickson B, Leland RW et al (1995) A multi-level algorithm for partitioning graphs. SC 95(28):1\u201314","journal-title":"SC"},{"issue":"1","key":"7907_CR17","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"7907_CR18","doi-asserted-by":"crossref","unstructured":"Karypis G, Kumar V (2000) Multilevel k-way hypergraph partitioning VLSI design 11(3):285\u2013300","DOI":"10.1155\/2000\/19436"},{"issue":"1","key":"7907_CR19","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) Multilevelk-way partitioning scheme for irregular graphs. J Parallel Distrib Comput 48(1):96\u2013129","journal-title":"J Parallel Distrib Comput"},{"key":"7907_CR20","doi-asserted-by":"crossref","unstructured":"Karypis G, Schloegel K, Kumar V (1997) Parmetis: Parallel graph partitioning and sparse matrix ordering library","DOI":"10.1006\/jpdc.1997.1403"},{"issue":"4","key":"7907_CR21","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416","journal-title":"Stat Comput"},{"issue":"2","key":"7907_CR22","first-page":"133","volume":"52","author":"KD Devine","year":"2006","unstructured":"Devine KD, Boman EG, Heaphy RT, Bisseling RH, Ataly Rek V (2006) New challenges in dynamic load balancing. Appl Numer Math 52(2):133\u2013152","journal-title":"Appl Numer Math"},{"key":"7907_CR23","doi-asserted-by":"crossref","unstructured":"Guerrieri A, Montresor A (2015) Dfep: Distributed funding-based edge partitioning. In: European Conference on Parallel Processing, pp 346\u2013358. Springer","DOI":"10.1007\/978-3-662-48096-0_27"},{"issue":"6","key":"7907_CR24","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1093\/nar\/gkx1313","volume":"46","author":"A Azad","year":"2018","unstructured":"Azad A, Pavlopoulos GA, Ouzounis CA, Kyrpides NC, Bulu\u00e7 A (2018) HIPMCL: a high-performance parallel implementation of the Markov clustering algorithm for large-scale networks. Nucleic Acids Res 46(6):33\u201333","journal-title":"Nucleic Acids Res"},{"key":"7907_CR25","unstructured":"Schwarzer D, Ganev S, Garg A, Ke NR, Blundell C (2020) Learning to partition graphs with aRL. In: International Conference on Learning Representations (ICLR)"},{"key":"7907_CR26","unstructured":"Li G, Xiong C, Thabet A, Ghanem B (2021) Graph partition neural networks for semi-supervised classification. In: International Conference on Learning Representations (ICLR)"},{"issue":"2","key":"7907_CR27","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur J Oper Res 290(2):405\u2013421","journal-title":"Eur J Oper Res"},{"key":"7907_CR28","doi-asserted-by":"crossref","unstructured":"Petroni F, Querzoni L, Daudjee K, Kamali S, Iacoboni G (2015) HDRF: Stream-based partitioning for power-law graphs. In: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, pp 243\u2013252. ACM","DOI":"10.1145\/2806416.2806424"},{"key":"7907_CR29","doi-asserted-by":"crossref","unstructured":"Dai D, Zhang W, Chen Y (2017) IOGP: An incremental online graph partitioning algorithm for distributed graph databases. In: Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing, pp 219\u2013230. ACM","DOI":"10.1145\/3078597.3078606"},{"key":"7907_CR30","doi-asserted-by":"crossref","unstructured":"Li Y, Li C, Orgerie A-C, Parv\u00e9dy PR (2021) WSGP: A window-based streaming graph partitioning approach. In: 2021 IEEE\/ACM 21st International Symposium on Cluster, Cloud and Internet Computing (CCGrid), pp 586\u2013595. IEEE","DOI":"10.1109\/CCGrid51090.2021.00068"},{"key":"7907_CR31","doi-asserted-by":"crossref","unstructured":"Faraj MF, Schulz C (2021) Buffered streaming graph partitioning. Preprint at arXiv:2102.09384","DOI":"10.1145\/3546911"},{"key":"7907_CR32","unstructured":"Hendrickson B, Leland R (1993) The chaco users guide. version 1.0. Technical report, Sandia National Labs., Albuquerque, NM (United States)"},{"key":"7907_CR33","doi-asserted-by":"crossref","unstructured":"Sanders P, Schulz C (2011) Engineering multilevel graph partitioning algorithms. In: European Symposium on Algorithms, pp 469\u2013480. Springer","DOI":"10.1007\/978-3-642-23719-5_40"},{"key":"7907_CR34","doi-asserted-by":"crossref","unstructured":"Sanders P, Schulz C (2012) Distributed evolutionary graph partitioning. In: 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp 16\u201329. SIAM","DOI":"10.1137\/1.9781611972924.2"},{"key":"7907_CR35","doi-asserted-by":"crossref","unstructured":"Sanders P, Schulz C (2013) Think locally, act globally: Highly balanced graph partitioning. In: International Symposium on Experimental Algorithms, pp 164\u2013175. Springer","DOI":"10.1007\/978-3-642-38527-8_16"},{"issue":"9","key":"7907_CR36","doi-asserted-by":"publisher","first-page":"2625","DOI":"10.1109\/TPDS.2017.2671868","volume":"28","author":"H Meyerhenke","year":"2017","unstructured":"Meyerhenke H, Sanders P, Schulz C (2017) Parallel graph partitioning for complex networks. IEEE Trans Parallel Distrib Syst 28(9):2625\u20132638","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"11","key":"7907_CR37","doi-asserted-by":"publisher","first-page":"2710","DOI":"10.1109\/TPDS.2020.3001645","volume":"31","author":"Y Akhremtsev","year":"2020","unstructured":"Akhremtsev Y, Sanders P, Schulz C (2020) High-quality shared-memory graph partitioning. IEEE Trans Parallel Distrib Syst 31(11):2710\u20132722","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"7907_CR38","doi-asserted-by":"crossref","unstructured":"Schlag S, Schulz C, Seemaier D, Strash D (2019) Scalable edge partitioning. In: 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX), pp 211\u2013225. SIAM","DOI":"10.1137\/1.9781611975499.17"},{"key":"7907_CR39","doi-asserted-by":"crossref","unstructured":"Slota GM, Rajamanickam S, Devine K, Madduri K (2017) Partitioning trillion-edge graphs in minutes. In: 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp 646\u2013655. IEEE","DOI":"10.1109\/IPDPS.2017.95"},{"key":"7907_CR40","doi-asserted-by":"crossref","unstructured":"Sakouhi C, Aridhi S, Guerrieri A, Sassi S, Montresor A (2016) Dynamicdfep: a distributed edge partitioning approach for large dynamic graphs. In: Proceedings of the 20th International Database Engineering & Applications Symposium, pp 142\u2013147. ACM","DOI":"10.1145\/2938503.2938506"},{"key":"7907_CR41","unstructured":"Nicoara D, Kamali S, Daudjee K, Chen L (2015) Hermes: Dynamic partitioning for distributed social network graph databases. In: EDBT, pp 25\u201336"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07907-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07907-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07907-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T18:07:34Z","timestamp":1759860454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07907-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,7]]},"references-count":41,"journal-issue":{"issue":"15","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["7907"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07907-2","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,7]]},"assertion":[{"value":"27 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"1418"}}