{"id":"https://openalex.org/W4200260420","doi":"https://doi.org/10.1109/hpec49654.2021.9622864","title":"Inverse-Deletion BFS - Revisiting Static Graph BFS Traversals with Dynamic Graph Operations","display_name":"Inverse-Deletion BFS - Revisiting Static Graph BFS Traversals with Dynamic Graph Operations","publication_year":2021,"publication_date":"2021-09-20","ids":{"openalex":"https://openalex.org/W4200260420","doi":"https://doi.org/10.1109/hpec49654.2021.9622864"},"language":"en","primary_location":{"id":"doi:10.1109/hpec49654.2021.9622864","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec49654.2021.9622864","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086521826","display_name":"Oded Green","orcid":"https://orcid.org/0000-0003-3658-1233"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]},{"id":"https://openalex.org/I4210127875","display_name":"Nvidia (United States)","ror":"https://ror.org/03jdj4y14","country_code":"US","type":"company","lineage":["https://openalex.org/I4210127875"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Oded Green","raw_affiliation_strings":["Georgia Institute of Technology, USA","NVIDIA Corporation"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"NVIDIA Corporation","institution_ids":["https://openalex.org/I4210127875"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086521826"],"corresponding_institution_ids":["https://openalex.org/I130701444","https://openalex.org/I4210127875"],"apc_list":null,"apc_paid":null,"fwci":0.4766,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.68267669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.8720484972000122},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.7570638656616211},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6779645085334778},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6206157803535461},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4987475872039795},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.42989492416381836},{"id":"https://openalex.org/keywords/snapshot","display_name":"Snapshot (computer storage)","score":0.4200674891471863},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41139721870422363},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.4066208302974701},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38226035237312317},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34519022703170776},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1620902121067047},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.09120982885360718}],"concepts":[{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.8720484972000122},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.7570638656616211},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6779645085334778},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6206157803535461},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4987475872039795},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.42989492416381836},{"id":"https://openalex.org/C55282118","wikidata":"https://www.wikidata.org/wiki/Q252683","display_name":"Snapshot (computer storage)","level":2,"score":0.4200674891471863},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41139721870422363},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.4066208302974701},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38226035237312317},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34519022703170776},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1620902121067047},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.09120982885360718}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec49654.2021.9622864","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec49654.2021.9622864","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1543897857","https://openalex.org/W1556784394","https://openalex.org/W1883226873","https://openalex.org/W1945186739","https://openalex.org/W1985291160","https://openalex.org/W2000041758","https://openalex.org/W2041470524","https://openalex.org/W2047345171","https://openalex.org/W2088961699","https://openalex.org/W2090710911","https://openalex.org/W2104734478","https://openalex.org/W2106553832","https://openalex.org/W2154111453","https://openalex.org/W2165301438","https://openalex.org/W2171707538","https://openalex.org/W2539828367","https://openalex.org/W2557279889","https://openalex.org/W2739409954","https://openalex.org/W2802440256","https://openalex.org/W2885584288","https://openalex.org/W2886821472","https://openalex.org/W2902093742","https://openalex.org/W2903351422","https://openalex.org/W2903380714","https://openalex.org/W2903539791","https://openalex.org/W2909844504","https://openalex.org/W2986726791","https://openalex.org/W2989620572","https://openalex.org/W3043803354","https://openalex.org/W3099866104","https://openalex.org/W4229537535","https://openalex.org/W4235810972","https://openalex.org/W4245208434","https://openalex.org/W4253426709","https://openalex.org/W4287255392","https://openalex.org/W6758627993","https://openalex.org/W6791942267"],"related_works":["https://openalex.org/W2797291190","https://openalex.org/W2786956989","https://openalex.org/W2007113317","https://openalex.org/W2887020706","https://openalex.org/W1821961669","https://openalex.org/W4254594467","https://openalex.org/W4252596799","https://openalex.org/W4230405657","https://openalex.org/W1978615272","https://openalex.org/W2200188075"],"abstract_inverted_index":{"Breadth-First":[0],"Search":[1],"(BFS)":[2],"traversals":[3,14,76],"appear":[4],"in":[5,25,50,128,154],"a":[6,44,81,88,96,101,109,120,165,188],"wide":[7],"range":[8],"of":[9,37,136,169],"applications":[10],"and":[11,21,46,66,158,194],"domains.":[12],"BFS":[13,59,75,102,121,130,167,193],"determine":[15],"the":[16,22,26,31,35,40,47,51,134,137,143,152,155],"distance":[17,29],"between":[18,30,43],"key":[19],"vertices":[20,24,32,49,153],"remaining":[23,48],"network.":[27],"The":[28],"often":[33],"called":[34],"number":[36],"hops,":[38],"is":[39,183],"shortest":[41],"path":[42],"root":[45],"graph.":[52],"Given":[53],"its":[54,113,181],"applicability":[55],"across":[56],"multiple":[57],"domains,":[58],"has":[60],"received":[61],"significant":[62],"attention":[63],"from":[64],"theoretical":[65],"applied":[67],"communities,":[68],"including":[69],"many":[70,197],"algorithms":[71],"for":[72,99,112,142],"parallelizing":[73],"BFS.":[74],"are":[77,140],"typically":[78],"conducted":[79],"on":[80],"graph":[82,111,125],"snapshot":[83],"(commonly":[84],"referred":[85],"to":[86,118,191],"as":[87],"static":[89,110],"graph).":[90],"In":[91],"this":[92],"paper,":[93],"we":[94,115,132],"show":[95,116,164],"novel":[97,189],"algorithm":[98,106],"executing":[100],"traversal.":[103],"While":[104,173],"our":[105,170,174],"also":[107],"uses":[108],"input,":[114],"how":[117],"perform":[119],"traversal":[122],"using":[123],"dynamic":[124],"operations.":[126],"Specifically,":[127],"each":[129],"level,":[131],"remove":[133],"subset":[135],"edges":[138,147],"that":[139],"unnecessary":[141],"next":[144,156],"phase.":[145],"These":[146],"do":[148],"not":[149,177],"impact":[150],"finding":[151],"level":[157],"reduce":[159],"random":[160],"memory":[161],"accesses.":[162],"We":[163],"top-down":[166],"variation":[168],"new":[171],"algorithm.":[172],"implementation":[175],"does":[176],"outperform":[178],"state-of-the-art":[179],"implementations,":[180],"performance":[182],"competitive.":[184],"Furthermore,":[185],"it":[186],"shows":[187],"way":[190],"implement":[192],"opens":[195],"up":[196],"research":[198],"opportunities.":[199]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-07T13:37:22.277990","created_date":"2025-10-10T00:00:00"}