{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T19:40:04Z","timestamp":1751312404209,"version":"3.41.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T00:00:00Z","timestamp":1750982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T00:00:00Z","timestamp":1750982400000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s11432-023-3916-0","type":"journal-article","created":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T07:01:45Z","timestamp":1751266905000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["G-SPAC: a more granular greedy graph partition algorithm with spatial locality and judgment-aware edge folding"],"prefix":"10.1007","volume":"68","author":[{"given":"Yuedan","family":"Chen","sequence":"first","affiliation":[]},{"given":"Zhijie","family":"Li","sequence":"additional","affiliation":[]},{"given":"Guoqing","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Peixin","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Xiaofei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Kenli","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,27]]},"reference":[{"key":"3916_CR1","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1145\/2567948.2576939","volume-title":"Proceedings of the 23rd International World Wide Web Conference","author":"S A Myers","year":"2014","unstructured":"Myers S A, Sharma A, Gupta P, et al. Information network or social network?: the structure of the Twitter follow graph. In: Proceedings of the 23rd International World Wide Web Conference, Seoul, 2014. 493\u2013498"},{"key":"3916_CR2","first-page":"123","volume-title":"Proceedings of the 31st IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2011 Workshops)","author":"T Y Wang","year":"2011","unstructured":"Wang T Y, Chen Y, Zhang Z B, et al. Understanding graph sampling algorithms for social network analysis. In: Proceedings of the 31st IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2011 Workshops), Minneapolis, 2011. 123\u2013128"},{"key":"3916_CR3","doi-asserted-by":"publisher","first-page":"042309","DOI":"10.1007\/s11432-014-5084-x","volume":"57","author":"K Shuang","year":"2014","unstructured":"Shuang K, Su S. PAIDD: a hybrid P2P-based architecture for improving data distribution in social networks. Sci China Inf Sci, 2014, 57: 042309","journal-title":"Sci China Inf Sci"},{"key":"3916_CR4","doi-asserted-by":"publisher","first-page":"2082","DOI":"10.1109\/TITS.2020.3031331","volume":"23","author":"Y Y Shin","year":"2022","unstructured":"Shin Y Y, Yoon Y. Incorporating dynamicity of transportation network with multi-weight traffic graph convolutional network for traffic forecasting. IEEE Trans Intell Transp Syst, 2022, 23: 2082\u20132092","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"3916_CR5","first-page":"57","volume-title":"Proceedings of the Latin America Data Science Workshop co-located with 44th International Conference on Very Large Data Bases (VLDB 2018)","author":"K Wehmuth","year":"2018","unstructured":"Wehmuth K, Costa B, Bechara J V, et al. A multilayer and time-varying structural analysis of the Brazilian air transportation network. In: Proceedings of the Latin America Data Science Workshop co-located with 44th International Conference on Very Large Data Bases (VLDB 2018), Rio de Janeiro, 2018. 57\u201364"},{"key":"3916_CR6","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1109\/TCYB.2019.2912718","volume":"51","author":"Y F Yu","year":"2021","unstructured":"Yu Y F, Xu G X, Jiang M, et al. Joint transformation learning via the L2,1-norm metric for robust graph matching. IEEE Trans Cybern, 2021, 51: 521\u2013533","journal-title":"IEEE Trans Cybern"},{"key":"3916_CR7","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1109\/TCYB.2016.2536752","volume":"47","author":"X Peng","year":"2017","unstructured":"Peng X, Yu Z D, Yi Z, et al. Constructing the L2-graph for robust subspace learning and subspace clustering. IEEE Trans Cybern, 2017, 47: 1053\u20131066","journal-title":"IEEE Trans Cybern"},{"key":"3916_CR8","doi-asserted-by":"publisher","first-page":"032104","DOI":"10.1007\/s11432-015-5420-9","volume":"59","author":"X M Wu","year":"2016","unstructured":"Wu X M, Du M N, Chen W H, et al. Salient object detection via region contrast and graph regularization. Sci China Inf Sci, 2016, 59: 032104","journal-title":"Sci China Inf Sci"},{"key":"3916_CR9","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/TKDE.2019.2931548","volume":"33","author":"H Xiao","year":"2021","unstructured":"Xiao H, Chen Y D, Shi X D. Knowledge graph embedding based on multi-view clustering framework. IEEE Trans Knowl Data Eng, 2021, 33: 585\u2013596","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3916_CR10","doi-asserted-by":"publisher","first-page":"3607","DOI":"10.1109\/TKDE.2020.2970044","volume":"33","author":"Y Shen","year":"2021","unstructured":"Shen Y, Ding N, Zheng H T, et al. Modeling relation paths for knowledge graph completion. IEEE Trans Knowl Data Eng, 2021, 33: 3607\u20133617","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3916_CR11","doi-asserted-by":"publisher","first-page":"169101","DOI":"10.1007\/s11432-018-9820-3","volume":"63","author":"L L Zhang","year":"2020","unstructured":"Zhang L L, Li D W, Xi Y G, et al. Reinforcement learning with actor-critic for knowledge graph reasoning. Sci China Inf Sci, 2020, 63: 169101","journal-title":"Sci China Inf Sci"},{"key":"3916_CR12","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TPDS.2018.2794989","volume":"29","author":"C Mayer","year":"2018","unstructured":"Mayer C, Tariq M A, Mayer R, et al. GrapH: traffic-aware graph processing. IEEE Trans Parallel Distrib Syst, 2018, 29: 1289\u20131302","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3916_CR13","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. Parallel graph partitioning for complex networks. IEEE Trans Parallel Distrib Syst, 2017, 28: 2625\u20132638","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3916_CR14","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1109\/TC.2016.2624289","volume":"66","author":"Y Zhang","year":"2017","unstructured":"Zhang Y, Liao X F, Jin H, et al. HotGraph: efficient asynchronous processing for real-world graphs. IEEE Trans Comput, 2017, 66: 799\u2013809","journal-title":"IEEE Trans Comput"},{"key":"3916_CR15","first-page":"166","volume-title":"Proceedings of the IEEE International Conference on Cluster Computing","author":"W D Zhang","year":"2018","unstructured":"Zhang W D, Zhang M Y. Graph partitioning algorithm with LSH: poster extended abstract. In: Proceedings of the IEEE International Conference on Cluster Computing, Belfast, 2018. 166\u2013167"},{"key":"3916_CR16","first-page":"1135","volume-title":"Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing","author":"D Delling","year":"2011","unstructured":"Delling D, Goldberg A V, Razenshteyn I P, et al. Graph partitioning with natural cuts. In: Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, Anchorage, 2011. 1135\u20131146"},{"key":"3916_CR17","volume-title":"Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science","author":"N Vikas","year":"2017","unstructured":"Vikas N. Computational complexity of graph partition under vertex-compaction to an irreflexive hexagon. In: Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, Aalborg, 2017"},{"key":"3916_CR18","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1109\/TC.2021.3059386","volume":"70","author":"A McCrabb","year":"2021","unstructured":"McCrabb A, Bertacco V. Optimizing vertex pressure dynamic graph partitioning in many-core systems. IEEE Trans Comput, 2021, 70: 936\u2013949","journal-title":"IEEE Trans Comput"},{"key":"3916_CR19","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1007\/s10115-019-01328-3","volume":"61","author":"N M Soudani","year":"2019","unstructured":"Soudani N M, Fatemi A, Nematbakhsh M. PPR-partitioning: a distributed graph partitioning algorithm based on the personalized PageRank vectors in vertex-centric systems. Knowl Inf Syst, 2019, 61: 847\u2013871","journal-title":"Knowl Inf Syst"},{"key":"3916_CR20","first-page":"1689","volume-title":"Proceedings of the 30th International Joint Conference on Artificial Intelligence","author":"H Jiang","year":"2021","unstructured":"Jiang H, Zhu D M, Xie Z C, et al. A new upper bound based on vertex partitioning for the maximum k-plex problem. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence, 2021. 1689\u20131696"},{"key":"3916_CR21","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/16M1079816","volume":"46","author":"T C Kwok","year":"2017","unstructured":"Kwok T C, Lau L C, Lee Y T. Improved Cheeger\u2019s inequality and analysis of local graph partitioning using vertex expansion and expansion profile. SIAM J Comput, 2017, 46: 890\u2013910","journal-title":"SIAM J Comput"},{"key":"3916_CR22","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1145\/3097983.3098033","volume-title":"Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"C Z Zhang","year":"2017","unstructured":"Zhang C Z, Wei F, Liu Q, et al. Graph edge partitioning via neighborhood heuristic. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, 2017. 605\u2013614"},{"key":"3916_CR23","first-page":"2081","volume-title":"Proceedings of the 37th IEEE International Conference on Data Engineering","author":"T Ayall","year":"2021","unstructured":"Ayall T, Duan H C, Liu C H, et al. Taking heuristic based graph edge partitioning one step ahead via offstream partitioning approach. In: Proceedings of the 37th IEEE International Conference on Data Engineering, Chania, 2021. 2081\u20132086"},{"key":"3916_CR24","first-page":"228","volume-title":"Proceedings of the 39th IEEE International Conference on Distributed Computing Systems","author":"S W Ji","year":"2019","unstructured":"Ji S W, Bu C Y, Li L, et al. Local graph edge partitioning with a two-stage heuristic method. In: Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, Dallas, 2019. 228\u2013237"},{"key":"3916_CR25","doi-asserted-by":"publisher","first-page":"2125","DOI":"10.1145\/3357384.3358088","volume-title":"Proceedings of the 28th ACM International Conference on Information and Knowledge Management","author":"H Li","year":"2019","unstructured":"Li H, Yuan H, Huang J. Real-time edge repartitioning for dynamic graph. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, Beijing, 2019. 2125\u20132128"},{"key":"3916_CR26","first-page":"1289","volume-title":"Proceedings of the International Conference on Management of Data","author":"R Mayer","year":"2021","unstructured":"Mayer R, Jacobsen H. Hybrid edge partitioner: partitioning large power-law graphs under memory constraints. In: Proceedings of the International Conference on Management of Data, 2021. 1289\u20131302"},{"key":"3916_CR27","first-page":"68","volume-title":"Proceedings of the 41st IEEE International Conference on Distributed Computing Systems","author":"S Zhang","year":"2021","unstructured":"Zhang S, Jiang Z T, Hou X Z, et al. An efficient and balanced graph partition algorithm for the subgraph-centric programming model on large-scale power-law graphs. In: Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, Washington DC, 2021. 68\u201378"},{"key":"3916_CR28","first-page":"283","volume-title":"Proceedings of the 37th IEEE International Conference on Distributed Computing Systems Workshops","author":"J Y Wang","year":"2017","unstructured":"Wang J Y, Zhang C F. Analysis and evaluation of the GAS model for distributed graph computation. In: Proceedings of the 37th IEEE International Conference on Distributed Computing Systems Workshops, Atlanta, 2017. 283\u2013285"},{"key":"3916_CR29","first-page":"1397","volume-title":"Proceedings of the 37th IEEE International Conference on Distributed Computing Systems","author":"A C Zhou","year":"2017","unstructured":"Zhou A C, Ibrahim S, He B S. On achieving efficient data transfer for graph processing in geo-distributed datacenters. In: Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, Atlanta, 2017. 1397\u20131407"},{"key":"3916_CR30","volume-title":"Proceedings of the 49th International Conference on Parallel Processing","author":"F Sheng","year":"2020","unstructured":"Sheng F, Cao Q, Jiang H, et al. GraBi: communication-efficient and workload-balanced partitioning for bipartite graphs. In: Proceedings of the 49th International Conference on Parallel Processing, Edmonton, 2020"},{"key":"3916_CR31","first-page":"563","volume-title":"Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2013)","author":"H Miao","year":"2013","unstructured":"Miao H, Liu X Y, Huang B, et al. A hypergraph-partitioned vertex programming approach for large-scale consensus optimization. In: Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2013), Santa Clara, 2013. 563\u2013568"},{"key":"3916_CR32","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1145\/2623330.2623660","volume-title":"Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"F Bourse","year":"2014","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, New York, 2014. 1456\u20131465"},{"key":"3916_CR33","first-page":"685","volume-title":"Proceedings of the 38th IEEE International Conference on Distributed Computing Systems","author":"C Mayer","year":"2018","unstructured":"Mayer C, Mayer R, Tariq M A, et al. ADWISE: adaptive window-based streaming edge partitioning for high-speed graph processing. In: Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, Vienna, 2018. 685\u2013695"},{"key":"3916_CR34","first-page":"1055","volume-title":"Proceedings of the IEEE International Parallel and Distributed Processing Symposium","author":"H Meyerhenke","year":"2015","unstructured":"Meyerhenke H, Sanders P, Schulz C. Parallel graph partitioning for complex networks. In: Proceedings of the IEEE International Parallel and Distributed Processing Symposium, Hyderabad, 2015. 1055\u20131064"},{"key":"3916_CR35","first-page":"1673","volume-title":"Proceedings of the Advances in Neural Information Processing Systems 27","author":"C Xie","year":"2014","unstructured":"Xie C, Yan L, Li W J, et al. Distributed power-law graph computing: Theoretical and empirical analysis. In: Proceedings of the Advances in Neural Information Processing Systems 27, Montreal, 2014. 1673\u20131681"},{"key":"3916_CR36","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/1963405.1963491","volume-title":"Proceedings of the 20th International Conference on World Wide Web","author":"S Suri","year":"2011","unstructured":"Suri S, Vassilvitskii S. Counting triangles and the curse of the last reducer. In: Proceedings of the 20th International Conference on World Wide Web, Hyderabad, 2011. 607\u2013614"},{"key":"3916_CR37","first-page":"17","volume-title":"Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation","author":"J E Gonzalez","year":"2012","unstructured":"Gonzalez J E, Low Y, Gu H J, et al. PowerGraph: distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation, Hollywood, 2012. 17\u201330"},{"key":"3916_CR38","volume-title":"Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006)","author":"A Abou-Rjeili","year":"2006","unstructured":"Abou-Rjeili A, Karypis G. Multilevel algorithms for partitioning power-law graphs. In: Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Rhodes Island, 2006"},{"key":"3916_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3084451","volume":"1","author":"L D Li","year":"2017","unstructured":"Li L D, Geda R, Hayes A B, et al. A simple yet effective balanced edge partition model for parallel computing. Proc ACM Meas Anal Comput Syst, 2017, 1: 1\u201321","journal-title":"Proc ACM Meas Anal Comput Syst"},{"key":"3916_CR40","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/S0167-8191(00)00048-X","volume":"26","author":"B Hendrickson","year":"2000","unstructured":"Hendrickson B, Kolda T G. Graph partitioning models for parallel computing. Parallel Computing, 2000, 26: 1519\u20131534","journal-title":"Parallel Computing"},{"key":"3916_CR41","first-page":"124101","volume":"97","author":"G Karypis","year":"1995","unstructured":"Karypis G, Kumar V. Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0. Appl Phys Lett, 1995, 97: 124101","journal-title":"Appl Phys Lett"},{"key":"3916_CR42","first-page":"495","volume-title":"Proceedings of the ACM International Conference on Management of Data","author":"W F Fan","year":"2017","unstructured":"Fan W F, Xu J B, Wu Y H, et al. Parallelizing sequential graph computations. In: Proceedings of the ACM International Conference on Management of Data, Chicago, 2017. 495\u2013510"},{"key":"3916_CR43","first-page":"4292","volume-title":"Proceedings of the 29th AAAI Conference on Artificial Intelligence","author":"R A Rossi","year":"2015","unstructured":"Rossi R A, Ahmed N K. The network data repository with interactive graph analytics and visualization. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, Austin, 2015. 4292\u20134293"},{"key":"3916_CR44","first-page":"1","volume":"38","author":"T A Davis","year":"2011","unstructured":"Davis T A, Hu Y F. The University of Florida sparse matrix collection. ACM Trans Math Softw, 2011, 38: 1\u201325","journal-title":"ACM Trans Math Softw"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-023-3916-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-023-3916-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-023-3916-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T19:02:32Z","timestamp":1751310152000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-023-3916-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,27]]},"references-count":44,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["3916"],"URL":"https:\/\/doi.org\/10.1007\/s11432-023-3916-0","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,27]]},"assertion":[{"value":"25 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"182101"}}