{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T02:23:19Z","timestamp":1769739799741,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,5,13]]},"DOI":"10.1145\/3308558.3313490","type":"proceedings-article","created":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:17:59Z","timestamp":1557749879000},"page":"961-971","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Current Flow Group Closeness Centrality for Complex Networks?"],"prefix":"10.1145","author":[{"given":"Huan","family":"Li","sequence":"first","affiliation":[{"name":"Fudan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Peng","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liren","family":"Shan","sequence":"additional","affiliation":[{"name":"Fudan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuhao","family":"Yi","sequence":"additional","affiliation":[{"name":"Fudan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongzhi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Fudan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,5,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1944345.1944349"},{"key":"e_1_3_2_1_2_1","volume-title":"Emergence of scaling in random networks. Science 286, 5439","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and Re\u00b4ka Albert . 1999. Emergence of scaling in random networks. Science 286, 5439 ( 1999 ), 509-512. Albert-L\u00e1szl\u00f3 Barab\u00e1si and Re\u00b4ka Albert. 1999. Emergence of scaling in random networks. Science 286, 5439 (1999), 509-512."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.17730\/humo.7.3.f4033344851gl053"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1121\/1.1906679"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/130950550"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975055.18"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974690.ch1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.865686"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872518.2891063"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2013.05.003"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_44"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2465378"},{"key":"e_1_3_2_1_13_1","first-page":"43","volume-title":"Proceedings (ADC '16)","author":"Chen Chen","year":"2016","unstructured":"Chen Chen , Wei Wang , and Xiaoyang Wang . 2016 . Efficient maximum closeness centrality group identification. In Databases Theory and Applications - 27th Australasian Database Conference , Proceedings (ADC '16) . Springer , 43 - 55 . Chen Chen, Wei Wang, and Xiaoyang Wang. 2016. Efficient maximum closeness centrality group identification. In Databases Theory and Applications - 27th Australasian Database Conference, Proceedings (ADC '16). Springer, 43-55."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2017.7963139"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6160248"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591833"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374441"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.07.019"},{"key":"e_1_3_2_1_19_1","volume-title":"Random Walks and Electric Networks","author":"Doyle Peter G","unstructured":"Peter G Doyle and J Laurie Snell . 1984. Random Walks and Electric Networks . Mathematical Association of America . Peter G Doyle and J Laurie Snell. 1984. Random Walks and Electric Networks. Mathematical Association of America."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1999.9990219"},{"key":"e_1_3_2_1_22_1","first-page":"9","volume-title":"Proceedings (WALCOM '11)","author":"Fink Martin","year":"2011","unstructured":"Martin Fink and Joachim Spoerhase . 2011 . Maximum betweenness centrality: approximability and tractable cases. In Algorithms and Computation - 5th International Workshop , Proceedings (WALCOM '11) . Springer , 9 - 20 . Martin Fink and Joachim Spoerhase. 2011. Maximum betweenness centrality: approximability and tractable cases. In Algorithms and Computation - 5th International Workshop, Proceedings (WALCOM '11). Springer, 9-20."},{"key":"e_1_3_2_1_23_1","unstructured":"Gerd Fricke Stephen T. Hedetniemi and David Pokrass Jacobs. 1998. Independence and Irredundance in k-Regular Graphs. Ars Comb. 49(1998).  Gerd Fricke Stephen T. Hedetniemi and David Pokrass Jacobs. 1998. Independence and Irredundance in k-Regular Graphs. Ars Comb. 49(1998)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623738"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2005.01.002"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1080\/03610918908812806"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/47\/3\/035003"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213979"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01164627"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2743021"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_35_1","volume-title":"the science of rating and ranking","author":"Langville Amy N","unstructured":"Amy N Langville and Carl D Meyer . 2012. Who's# 1? : the science of rating and ranking . Princeton University Press . Amy N Langville and Carl D Meyer. 2012. Who's# 1?: the science of rating and ranking. Princeton University Press."},{"key":"e_1_3_2_1_36_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014).  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816696"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2016.06.007"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939869"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.103"},{"key":"e_1_3_2_1_41_1","first-page":"1151","volume-title":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '13)","author":"Gary","unstructured":"Gary L. Miller and Richard Peng. 2013. Approximate Maximum Flow on Separable Undirected Graphs . In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '13) . SIAM, 1151 - 1170 . Gary L. Miller and Richard Peng. 2013. Approximate Maximum Flow on Separable Undirected Graphs. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '13). SIAM, 1151-1170."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.009"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/1809753"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5718151"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2014.6859421"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806431"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771430"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(89)90016-6"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.54"},{"key":"e_1_3_2_1_52_1","volume-title":"Collective dynamics of small-world networks. Nature 393, 6684","author":"Watts Duncan J","year":"1998","unstructured":"Duncan J Watts and Steven H Strogatz . 1998. Collective dynamics of small-world networks. Nature 393, 6684 ( 1998 ), 440. Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of small-world networks. Nature 393, 6684 (1998), 440."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956782"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2651825"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623626"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2579356"},{"key":"e_1_3_2_1_57_1","first-page":"323","volume-title":"Proceedings, Part II (DASFAA '17)","author":"Zhao Pengpeng","year":"2017","unstructured":"Pengpeng Zhao , Yongkun Li , Hong Xie , Zhiyong Wu , Yinlong Xu , and John CS Lui . 2017 . Measuring and Maximizing Influence via Random Walk in Social Activity Networks. In Database Systems for Advanced Applications - 22nd International Conference , Proceedings, Part II (DASFAA '17) . Springer , 323 - 338 . Pengpeng Zhao, Yongkun Li, Hong Xie, Zhiyong Wu, Yinlong Xu, and John CS Lui. 2017. Measuring and Maximizing Influence via Random Walk in Social Activity Networks. In Database Systems for Advanced Applications - 22nd International Conference, Proceedings, Part II (DASFAA '17). Springer, 323-338."}],"event":{"name":"WWW '19: The Web Conference","location":"San Francisco CA USA","acronym":"WWW '19","sponsor":["IW3C2 International World Wide Web Conference Committee"]},"container-title":["The World Wide Web Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308558.3313490","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3308558.3313490","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:19Z","timestamp":1750204399000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308558.3313490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,13]]},"references-count":57,"alternative-id":["10.1145\/3308558.3313490","10.1145\/3308558"],"URL":"https:\/\/doi.org\/10.1145\/3308558.3313490","relation":{},"subject":[],"published":{"date-parts":[[2019,5,13]]},"assertion":[{"value":"2019-05-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}