{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T15:24:28Z","timestamp":1774279468081,"version":"3.50.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172151"],"award-info":[{"award-number":["62172151"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Sustain. Comput."],"published-print":{"date-parts":[[2023,7,1]]},"DOI":"10.1109\/tsusc.2023.3263172","type":"journal-article","created":{"date-parts":[[2023,4,10]],"date-time":"2023-04-10T19:32:29Z","timestamp":1681155149000},"page":"412-422","source":"Crossref","is-referenced-by-count":9,"title":["Critical Path Awareness Techniques for Large-Scale Graph Partitioning"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7380-8997","authenticated-orcid":false,"given":"Baixuan","family":"Wu","sequence":"first","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1144-7599","authenticated-orcid":false,"given":"Zheng","family":"Xiao","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8118-9700","authenticated-orcid":false,"given":"Peiying","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9081-8153","authenticated-orcid":false,"given":"Zhuo","family":"Tang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2635-7716","authenticated-orcid":false,"given":"Kenli","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3090759"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(95)00008-4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2017.08.031"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3131611"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/43.863641"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/274535.274546"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.012582999"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS52030.2021.00061"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.1998.10018"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSUSC.2021.3057983"},{"key":"ref17","article-title":"Gap: Generalizable approximate graph partitioning framework","author":"nazi","year":"2019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/ab3456"},{"key":"ref19","author":"bui","year":"1993","journal-title":"A Heuristic for Reducing Fill-in in Sparse Matrix Factorization"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2019.05.010"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2541228.2555309"},{"key":"ref23","article-title":"METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices","author":"karypis","year":"1997"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/196244.196609"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/321623.321627"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/43.644609"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4330060203"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/157485.165119"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/18M1176865"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-020-09448-8"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5412-3_12"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-0944-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(79)90043-X"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/12.508322","article-title":"Genetic algorithm and graph partitioning","volume":"45","author":"bui","year":"1996","journal-title":"IEEE Trans Comput"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0916028"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/109025.109102"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.30"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488393"}],"container-title":["IEEE Transactions on Sustainable Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7274860\/10244170\/10098534.pdf?arnumber=10098534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T18:39:10Z","timestamp":1695667150000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10098534\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,1]]},"references-count":31,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tsusc.2023.3263172","relation":{},"ISSN":["2377-3782","2377-3790"],"issn-type":[{"value":"2377-3782","type":"electronic"},{"value":"2377-3790","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,1]]}}}