{"id":"https://openalex.org/W2983843017","doi":"https://doi.org/10.1145/3364212","title":"Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs","display_name":"Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs","publication_year":2019,"publication_date":"2019-09-30","ids":{"openalex":"https://openalex.org/W2983843017","doi":"https://doi.org/10.1145/3364212","mag":"2983843017"},"language":"en","primary_location":{"id":"doi:10.1145/3364212","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3364212","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-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/A5014870050","display_name":"Shahbaz Khan","orcid":"https://orcid.org/0000-0001-9352-0088"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Shahbaz Khan","raw_affiliation_strings":["Department of CSE, IIT Kanpur, Kanpur, UP, India"],"affiliations":[{"raw_affiliation_string":"Department of CSE, IIT Kanpur, Kanpur, UP, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014870050"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":null,"apc_paid":null,"fwci":0.194,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.55820666,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"6","issue":"3","first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9979000091552734,"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/undirected-graph","display_name":"Undirected graph","score":0.7200065851211548},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6563674807548523},{"id":"https://openalex.org/keywords/distributed-file-system","display_name":"Distributed File System","score":0.6165918707847595},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5841831564903259},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.5479176640510559},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5280003547668457},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48923277854919434},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4793984889984131},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4704177677631378},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.4649084508419037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45579302310943604},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44061172008514404},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3961165249347687},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3485258221626282},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.15362516045570374}],"concepts":[{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.7200065851211548},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6563674807548523},{"id":"https://openalex.org/C152043487","wikidata":"https://www.wikidata.org/wiki/Q1229600","display_name":"Distributed File System","level":2,"score":0.6165918707847595},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5841831564903259},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.5479176640510559},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5280003547668457},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48923277854919434},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4793984889984131},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4704177677631378},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.4649084508419037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45579302310943604},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44061172008514404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3961165249347687},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3485258221626282},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.15362516045570374},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3364212","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3364212","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/14","display_name":"Life below water","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W31329063","https://openalex.org/W45869233","https://openalex.org/W1523934134","https://openalex.org/W1590701623","https://openalex.org/W1721652159","https://openalex.org/W1977458171","https://openalex.org/W1978583881","https://openalex.org/W1978615272","https://openalex.org/W1982792741","https://openalex.org/W1983546080","https://openalex.org/W1986973819","https://openalex.org/W1991752483","https://openalex.org/W1995587182","https://openalex.org/W1998776409","https://openalex.org/W2003024612","https://openalex.org/W2008292658","https://openalex.org/W2012456804","https://openalex.org/W2016289973","https://openalex.org/W2020283440","https://openalex.org/W2023670982","https://openalex.org/W2030218931","https://openalex.org/W2030543286","https://openalex.org/W2032370604","https://openalex.org/W2032793800","https://openalex.org/W2046946959","https://openalex.org/W2049105156","https://openalex.org/W2049327803","https://openalex.org/W2049713017","https://openalex.org/W2055655252","https://openalex.org/W2056942590","https://openalex.org/W2058330097","https://openalex.org/W2063860324","https://openalex.org/W2064306958","https://openalex.org/W2073273423","https://openalex.org/W2077059864","https://openalex.org/W2080566336","https://openalex.org/W2085467310","https://openalex.org/W2113734481","https://openalex.org/W2118382442","https://openalex.org/W2120490947","https://openalex.org/W2170762273","https://openalex.org/W2395939851","https://openalex.org/W2467525240","https://openalex.org/W2591972614","https://openalex.org/W2611566349","https://openalex.org/W2613095197","https://openalex.org/W2752885492","https://openalex.org/W2779584863","https://openalex.org/W2962916904","https://openalex.org/W3101261712","https://openalex.org/W3121437753","https://openalex.org/W4205300528","https://openalex.org/W4230889046","https://openalex.org/W4237850333","https://openalex.org/W4312512934"],"related_works":["https://openalex.org/W2095393099","https://openalex.org/W2284006119","https://openalex.org/W2983843017","https://openalex.org/W3101261712","https://openalex.org/W2130895195","https://openalex.org/W2023468831","https://openalex.org/W2894611796","https://openalex.org/W1998776409","https://openalex.org/W2023670982","https://openalex.org/W2788371145"],"abstract_inverted_index":{"Depth":[0],"first":[1,307],"search":[2],"(DFS)":[3],"tree":[4,23,57,100,182,239,294,317],"is":[5,75,232,262],"a":[6,21,33,50,98,128,180,213,237,279,292,300,315],"fundamental":[7],"data":[8,214],"structure":[9,215],"for":[10,19,32,53,148,224,290,313],"solving":[11],"various":[12],"graph":[13,36,61,186,207,243],"problems.":[14],"The":[15],"classical":[16],"algorithm":[17,52,74,81,119,132,276],"[54]":[18],"building":[20],"DFS":[22,56,99,152,156,165,181,203,238,275,293,316],"requires":[24],"O":[25,218],"(":[26,219],"m":[27,42,193,220],"+":[28],"n":[29,39,68,122,143,251,269,287],")":[30,69,123],"time":[31,109,124,139,189,249],"given":[34],"undirected":[35,60,159,185,206],"G":[37],"having":[38],"vertices":[40],"and":[41,153,299,310],"edges.":[43],"Recently,":[44],"Baswana":[45],"et":[46],"al.":[47],"[5]":[48],"presented":[49],"simple":[51],"updating":[54],"the":[55,91,95,116,235,241,296,306,319],"of":[58,157,172,183,216,227,240],"an":[59,63,80,112,158,168,184,196,254],"after":[62],"edge/vertex":[64],"update":[65,191],"in":[66,106,187,234,247,278,295,318],"\u00d5(":[67],"1":[70],"time.":[71],"However,":[72],"their":[73],"strictly":[76],"sequential.":[77],"We":[78],"present":[79],"achieving":[82],"similar":[83],"bounds":[84],"that":[85,223],"can":[86,101,133,178,208,244],"be":[87,102,134,209,245],"easily":[88],"adopted":[89],"to":[90,136,211],"parallel":[92,96,146],"environment.":[93],"In":[94],"environment,":[97],"computed":[103,246],"from":[104],"scratch":[105],"expected":[107],"\u00d5(1)":[108,188,248],"[2]":[110],"on":[111,127,195,253],"EREW":[113,197,255],"PRAM,":[114],"whereas":[115],"best":[117],"deterministic":[118,145],"takes":[120],"\u00d5(\u221a":[121],"[2,":[125],"27]":[126],"CRCW":[129],"PRAM.":[130,198,256],"Our":[131],"used":[135],"develop":[137],"optimal":[138,265,283],"(to":[140,266,284],"poly":[141,267,285],"log":[142,268,286],"factors)":[144,288],"algorithms":[147,289,312],"maintaining":[149,291,314],"fully":[150,273],"dynamic":[151,274,320],"fault":[154],"tolerant":[155,202],"graph.":[160],"(1)":[161],"Parallel":[162,200],"Fully":[163],"Dynamic":[164],":":[166,204],"Given":[167],"arbitrary":[169],"online":[170],"sequence":[171],"vertex":[173],"or":[174],"edge":[175],"updates,":[176],"we":[177],"maintain":[179],"per":[190],"using":[192,250],"processors":[194,252],"(2)":[199],"Fault":[201],"An":[205],"preprocessed":[210],"build":[212],"size":[217],"),":[221],"such":[222],"any":[225],"set":[226],"k":[228,231,259],"updates":[229],"(where":[230],"constant)":[233],"graph,":[236],"updated":[242],"For":[257],"constant":[258],",":[260],"this":[261],"also":[263],"work":[264],"factors).":[270],"Moreover,":[271],"our":[272],"provides,":[277],"seamless":[280],"manner,":[281],"nearly":[282],"semi-streaming":[297],"environment":[298],"restricted":[301],"distributed":[302,311],"model.":[303],"These":[304],"are":[305],"parallel,":[308],"semi-streaming,":[309],"setting.":[321]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}