{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T15:17:33Z","timestamp":1777735053839,"version":"3.51.4"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602330"],"award-info":[{"award-number":["61602330"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Talent Foundation of Sichuan University in China","award":["2082204194050"],"award-info":[{"award-number":["2082204194050"]}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP120102627"],"award-info":[{"award-number":["DP120102627"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2017,5,1]]},"DOI":"10.1109\/tkde.2017.2651825","type":"journal-article","created":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T19:11:10Z","timestamp":1484161870000},"page":"1017-1030","source":"Crossref","is-referenced-by-count":52,"title":["Efficient Algorithms for the Identification of Top-$k$ Structural Hole Spanners in Large Social Networks"],"prefix":"10.1109","volume":"29","author":[{"given":"Wenzheng","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mojtaba","family":"Rezvani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weifa","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengfei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.03.029"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.48"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1116502109"},{"key":"ref10","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2007.01.006"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2503792.2503797"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939807"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536272"},{"key":"ref16","first-page":"300","article-title":"Beyond'caveman communities’: Hubs and spokes for graph compression and mining","author":"kang","year":"2011","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386835"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488461"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487691"},{"key":"ref3","article-title":"The\n complexity of finding most vital arcs and nodes","author":"bar-noy","year":"1995"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1086\/421787"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9190-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963499"},{"key":"ref8","author":"burt","year":"2009","journal-title":"Structural Holes The Social Structure of Competition"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.5465\/AMJ.2007.24162082"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"ref9","first-page":"659","article-title":"Average\n distance queries through weighted samples in graphs and metric spaces: High scalability with tight statistical\n guarantees","author":"chechik","year":"2015","journal-title":"Proc 18th Int Workshop Approximation Algorithms Combinatorial Optimization Problems 19th Int Workshop Randomization Comput"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2667105"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2630805"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080102"},{"key":"ref21","first-page":"1999","article-title":"The PageRank citation ranking: Bringing\n order to the Web","author":"page","year":"1999"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010589300829"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806431"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124382"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7891084\/07814241.pdf?arnumber=7814241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:27:20Z","timestamp":1642004840000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7814241\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,1]]},"references-count":33,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2651825","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2017,5,1]]}}}