{"id":"https://openalex.org/W7131117342","doi":"https://doi.org/10.48550/arxiv.2602.17811","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","display_name":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","publication_year":2026,"publication_date":"2026-02-19","ids":{"openalex":"https://openalex.org/W7131117342","doi":"https://doi.org/10.48550/arxiv.2602.17811"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.17811","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126588049","display_name":"Guy Blelloch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Blelloch, Guy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126615088","display_name":"Andrew Brady","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Brady, Andrew","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065818820","display_name":"Laxman Dhulipala","orcid":"https://orcid.org/0000-0003-0685-064X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dhulipala, Laxman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011772692","display_name":"Jeremy T. Fineman","orcid":"https://orcid.org/0009-0000-7483-4532"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fineman, Jeremy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061083611","display_name":"Kishen N. Gowda","orcid":"https://orcid.org/0000-0001-6573-9445"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gowda, Kishen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5125385563","display_name":"Chase Hutton","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hutton, Chase","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9236999750137329,"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.9236999750137329,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.019899999722838402,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.01720000058412552,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/orientation","display_name":"Orientation (vector space)","score":0.6843000054359436},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5978999733924866},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5400999784469604},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4449999928474426},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4185999929904938},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4129999876022339},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.39469999074935913},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3926999866962433},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.3709000051021576}],"concepts":[{"id":"https://openalex.org/C16345878","wikidata":"https://www.wikidata.org/wiki/Q107472979","display_name":"Orientation (vector space)","level":2,"score":0.6843000054359436},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6017000079154968},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5978999733924866},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5400999784469604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.520799994468689},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4449999928474426},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4185999929904938},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4129999876022339},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.39469999074935913},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3926999866962433},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38909998536109924},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3709000051021576},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3628999888896942},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.35600000619888306},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.35580000281333923},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3086000084877014},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.2948000133037567},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2840000092983246},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.28130000829696655},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.271699994802475},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2662000060081482}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.17811","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.17811","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.17811","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.17811","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"low":[1,82],"out-degree":[2,18,83],"orientation":[3,84,127,161,193],"directs":[4],"each":[5],"edge":[6,49,170,221,245],"of":[7,14,19,33,53,85,101,145,181,231],"an":[8,86,124,135],"undirected":[9,87],"graph":[10],"with":[11,46,59,95,128,163,214,239],"the":[12,16,23,36,41,64,99,107,117,140,179,182,186,228],"goal":[13,37],"minimizing":[15,106],"maximum":[17],"a":[20,54,81,150,157,175,208,237],"vertex.":[21],"In":[22,70],"parallel":[24,45,76,119],"batch-dynamic":[25,77,120],"setting,":[26],"one":[27],"can":[28],"insert":[29],"or":[30],"delete":[31],"batches":[32],"edges,":[34],"and":[35,58,198,233],"is":[38,68,104,116,156,174,207],"to":[39,51,122],"process":[40],"entire":[42,65],"batch":[43,66],"in":[44,134,202],"work":[47,132,143,168,219,243],"per":[48,169,220,244],"similar":[50],"that":[52,67],"single":[55],"sequential":[56,188],"update":[57],"span":[60],"(or":[61],"depth)":[62],"for":[63,79],"polylogarithmic.":[69],"this":[71,102],"paper":[72,103],"we":[73],"present":[74],"faster":[75],"algorithms":[78],"maintaining":[80],"graph.":[88,183],"All":[89],"results":[90],"herein":[91],"achieve":[92],"polylogarithmic":[93],"depth,":[94],"high":[96],"probability":[97],"(whp);":[98],"focus":[100],"on":[105,178],"work,":[108],"which":[109,235],"varies":[110],"across":[111],"results.":[112],"Our":[113,153,204],"first":[114,118],"result":[115,155,206,230],"algorithm":[121,162,194,213,224],"maintain":[123],"asymptotically":[125,129],"optimal":[126,130],"expected":[131,164,217],"bounds,":[133],"amortized":[136],"sense,":[137],"improving":[138],"over":[139],"prior":[141],"best":[142],"bounds":[144],"Liu":[146],"et":[147],"al.~[SPAA~'22]":[148],"by":[149,196],"logarithmic":[151],"factor.":[152],"second":[154],"$O(c":[158,190,209],"\\log":[159,191,211],"n)$":[160,192,216,241],"worst-case":[165,189,218,242],"$O(\\sqrt{\\log":[166],"n})$":[167],"update,":[171],"where":[172],"$c$":[173],"known":[176],"upper-bound":[177],"arboricity":[180],"This":[184,223],"matches":[185],"best-known":[187],"given":[195],"Berglin":[197],"Brodal":[199],"~[Algorithmica~'18],":[200],"albeit":[201],"expectation.":[203],"final":[205],"+":[210],"n)$-orientation":[212],"$O(\\log^2":[215],"update.":[222],"significantly":[225],"improves":[226],"upon":[227],"recent":[229],"Ghaffari":[232],"Koo~[SPAA~'25],":[234],"maintains":[236],"$O(c)$-orientation":[238],"$O(\\log^9":[240],"whp.":[246]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-24T00:00:00"}