{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:59:07Z","timestamp":1761947947108},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2014,9,1]]},"DOI":"10.1093\/comjnl\/bxu003","type":"journal-article","created":{"date-parts":[[2014,2,2]],"date-time":"2014-02-02T21:48:14Z","timestamp":1391377694000},"page":"1371-1382","source":"Crossref","is-referenced-by-count":29,"title":["An Efficient Algorithm for Approximate Betweenness Centrality Computation"],"prefix":"10.1093","volume":"57","author":[{"given":"M. H.","family":"Chehreghani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2014,2,2]]},"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/57\/9\/1371\/1528263\/bxu003.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T00:49:49Z","timestamp":1503449389000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxu003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,2]]},"references-count":0,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2014,8,26]]},"published-print":{"date-parts":[[2014,9,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxu003","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,2]]}}}