{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T04:53:21Z","timestamp":1775883201364,"version":"3.50.1"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/tkde.2026.3670233","type":"journal-article","created":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T20:51:31Z","timestamp":1772657491000},"page":"3095-3108","source":"Crossref","is-referenced-by-count":0,"title":["Scaling up Electrical Closeness Centrality Computation"],"prefix":"10.1109","volume":"38","author":[{"given":"Meihao","family":"Liao","sequence":"first","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8658-6599","authenticated-orcid":false,"given":"Rong-Hua","family":"Li","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiangqiang","family":"Dai","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0181-8379","authenticated-orcid":false,"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/140976649"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctt7t8z9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/s0378-8733(01)00038-7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69311-6_21"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.056104"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2013.05.003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6761082"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717964"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/20M1361328"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cny036"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.96.032311"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.715115"},{"key":"ref14","first-page":"6:1","article-title":"Approximation of the diagonal of a laplacian\u2019s pseudoinverse for complex network analysis","volume-title":"Proc. 28th Annu. Eur. Symp. Algorithms","author":"Angriman"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-981-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3588922"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0603033"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cplett.2008.02.060"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05411-3_4"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/jpr.2018.68"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2013.08.039"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2020.10.018"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.01.030"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-018-2124-8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.70675\/e28a8fa1z89ddz4d1bz85a4z0dac1aad4f3f"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"ref27","first-page":"3733","article-title":"Efficient algorithms for spanning tree centrality","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Hayashi"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237880"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v5-1016"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2007.01.003"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.68"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001"},{"key":"ref34","article-title":"SNAP datasets: Stanford large network dataset collection","author":"Leskovec","year":"2014"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/22M1480823"},{"key":"ref36","article-title":"Robust and practical solution of laplacian equations by approximate elimination","author":"Gao","year":"2023"},{"key":"ref37","article-title":"Planet dump retrieved from https:\/\/planet.osm.org","year":"2017"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00587-4"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2021.3084879"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054497"},{"key":"ref42","article-title":"Estimating the inverse trace using random forests on graphs","author":"Barthelm\u00e9","year":"2019"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526140"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/0403039"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.3390\/a11040053"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188852"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_12"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/050643799"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467361"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3588696"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098072"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457298"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835823"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3589305"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11479420\/11421016.pdf?arnumber=11421016","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T04:21:01Z","timestamp":1775881261000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11421016\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":55,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2026.3670233","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]}}}