{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:05:32Z","timestamp":1772791532840,"version":"3.50.1"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T00:00:00Z","timestamp":1632096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T00:00:00Z","timestamp":1632096000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T00:00:00Z","timestamp":1632096000000},"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":[],"published-print":{"date-parts":[[2021,9,20]]},"DOI":"10.1109\/hpec49654.2021.9622864","type":"proceedings-article","created":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T20:57:36Z","timestamp":1638392256000},"page":"1-7","source":"Crossref","is-referenced-by-count":5,"title":["Inverse-Deletion BFS - Revisiting Static Graph BFS Traversals with Dynamic Graph Operations"],"prefix":"10.1109","author":[{"given":"Oded","family":"Green","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.64"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2015.8"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688538"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547541"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96983-1_45"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2019.00010"},{"key":"ref13","article-title":"The SuiteSparse Matrix Collection","author":"davis","year":"2018"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087580"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210414"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2012.6408680"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45591-4_68"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547759"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916333"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00059"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.50"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS47924.2020.00019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161102"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547571"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.2172\/951102"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.21236\/ADA575485"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3155284.3018756"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/588"},{"key":"ref9","first-page":"65","article-title":"Parallel breadth-first search on distributed memory systems","author":"buluc\u00b8","year":"2011","journal-title":"2011 ACM\/IEEE Int’l Conf for High Performance Computing Networking Storage and Analysis"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.34"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2013.05.203"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547581"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761622"},{"key":"ref24","article-title":"ButterFly BFS - An Efficient Communication Pattern for Multi Node Traversals","author":"green","year":"2021"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"key":"ref26","article-title":"Programming Strategies for Irregular Algorithms on the Emu Chick","author":"hein","year":"2018"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2018.00097"}],"event":{"name":"2021 IEEE High Performance Extreme Computing Conference (HPEC)","location":"Waltham, MA, USA","start":{"date-parts":[[2021,9,20]]},"end":{"date-parts":[[2021,9,24]]}},"container-title":["2021 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9622740\/9622741\/09622864.pdf?arnumber=9622864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:53:50Z","timestamp":1652201630000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9622864\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,20]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/hpec49654.2021.9622864","relation":{},"subject":[],"published":{"date-parts":[[2021,9,20]]}}}