{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:36:19Z","timestamp":1780346179660,"version":"3.54.1"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1109\/ipdps.2009.5161100","type":"proceedings-article","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T19:56:45Z","timestamp":1248119805000},"page":"1-8","source":"Crossref","is-referenced-by-count":80,"title":["A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets"],"prefix":"10.1109","author":[{"given":"Kamesh","family":"Madduri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Ediger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karl","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David A.","family":"Bader","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Chavarria-Miranda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"17","author":"madduri","year":"0"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1201\/9781584889106.ch12","article-title":"multithreaded algorithms for processing massive graphs","author":"madduri","year":"2007","journal-title":"Petascale Computing Algorithms and Applications"},{"key":"13","article-title":"finding good nearly balanced cuts in power law graphs","author":"lang","year":"2004"},{"key":"14","year":"0"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1038\/35075138"},{"key":"12","year":"0"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.57"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_10"},{"key":"1","author":"bader","year":"2006","journal-title":"HPC graph analysis benchmark"},{"key":"10","year":"0"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/971617.971643"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"4","first-page":"41","article-title":"scalable synthetic compact applications for benchmarking high productivity computing systems","volume":"2","author":"bader","year":"2006","journal-title":"CT-Watch Quarterly"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0407994102"},{"key":"8","year":"2004","journal-title":"High productivity computing systems project"}],"event":{"name":"Distributed Processing (IPDPS)","location":"Rome, Italy","start":{"date-parts":[[2009,5,23]]},"end":{"date-parts":[[2009,5,29]]}},"container-title":["2009 IEEE International Symposium on Parallel & Distributed Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5136864\/5160846\/05161100.pdf?arnumber=5161100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T22:06:46Z","timestamp":1497823606000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5161100\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2009.5161100","relation":{},"subject":[],"published":{"date-parts":[[2009,5]]}}}