{"id":"https://openalex.org/W7153331539","doi":"https://doi.org/10.48550/arxiv.2604.07515","title":"Parallel Batch-Dynamic Maximal Independent Set","display_name":"Parallel Batch-Dynamic Maximal Independent Set","publication_year":2026,"publication_date":"2026-04-08","ids":{"openalex":"https://openalex.org/W7153331539","doi":"https://doi.org/10.48550/arxiv.2604.07515"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.07515","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.07515","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.07515","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133322071","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/A5133345891","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":"last","author":{"id":"https://openalex.org/A5021730020","display_name":"Jared Joel Tuck Leong Lo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lo, Jared","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"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.5580999851226807,"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.5580999851226807,"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.2621000111103058,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.025599999353289604,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.7275000214576721},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5303999781608582},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5153999924659729},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4271000027656555},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.39800000190734863},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.388700008392334},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.37389999628067017},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.3353999853134155}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.7275000214576721},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5357000231742859},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5318999886512756},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5303999781608582},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5153999924659729},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4271000027656555},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.39800000190734863},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.388700008392334},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.37389999628067017},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3709000051021576},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3353999853134155},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3249000012874603},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.32019999623298645},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3034000098705292},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.29510000348091125},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29429998993873596},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2703000009059906},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.25270000100135803}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.07515","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.07515","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":"doi:10.48550/arxiv.2604.07515","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.07515","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6345514059066772}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,212,247],"develop":[1,214],"the":[2,8,17,41,48,70,80,83,134,139,148,170,186,195,203,206,220,231,254,268,276],"first":[3,162],"theoretically-efficient":[4],"algorithm":[5,39,53,117,136,273],"for":[6,34,88,189,223],"maintaining":[7],"maximal":[9,42],"independent":[10,43],"set":[11,44,222,234],"(MIS)":[12],"of":[13,30,113,153,169,178,197,205,208,226,230,256,270],"a":[14,24,37,111,160,166,176,190,198,215,224],"graph":[15,25],"in":[16,108,138],"parallel":[18,38,282],"batch-dynamic":[19,52],"setting.":[20],"In":[21,79],"this":[22,250],"setting,":[23,82],"is":[26,54,59,200,235,263,275],"updated":[27],"with":[28,47,127,147],"batches":[29],"edge":[31],"insertions/deletions,":[32],"and":[33,73,92,96,124,155,181,237],"each":[35,209],"batch":[36,112,199,225,232],"updates":[40,71],"to":[45,218,239,252],"agree":[46],"new":[49,216],"graph.":[50],"A":[51],"considered":[55],"efficient":[56,61],"if":[57],"it":[58],"work":[60,67,123,255],"(i.e.,":[62],"does":[63],"no":[64],"more":[65],"asymptotic":[66],"than":[68,244],"applying":[69],"sequentially)":[72],"has":[74,118],"polylogarithmic":[75,125],"depth":[76,126,262,279],"(parallel":[77],"time).":[78],"sequential":[81,140,149],"best":[84,135],"known":[85],"dynamic":[86,141,150],"algorithms":[87,152],"MIS,":[89],"by":[90],"Chechik":[91],"Zhang":[93],"(CZ)":[94],"[FOCS19]":[95],"Behnezhad":[97],"et":[98],"al.":[99],"(BDHSS)":[100],"[FOCS19],":[101],"take":[102],"$O(\\log^4":[103],"n)$":[104,121],"time":[105],"per":[106],"update":[107,210],"expectation.":[109],"For":[110],"$b$":[114],"updates,":[115],"our":[116,157,257,261,272],"$O(b":[119],"\\log^3":[120],"expected":[122],"high":[128],"probability":[129],"(whp).":[130],"It":[131],"therefore":[132,213],"outperforms":[133],"even":[137],"case":[142],"($b":[143],"=":[144],"1)$.":[145],"As":[146],"MIS":[151,163],"CZ":[154],"BDHSS,":[156],"solution":[158],"maintains":[159],"lexicographically":[161],"based":[164],"on":[165,175,281],"random":[167],"ordering":[168],"vertices.":[171],"Their":[172],"analysis":[173,243],"relied":[174],"result":[177],"Censor-Hillel,":[179],"Haramaty":[180],"Karnin":[182],"[PODC16]":[183],"that":[184,267],"bounded":[185],"``influence":[187],"set\"":[188],"single":[191],"update,":[192],"but":[193],"surprisingly,":[194],"influence":[196,207,221,233],"not":[201],"simply":[202],"union":[204],"therein.":[211],"approach":[217],"analyze":[219],"updates.":[227],"Our":[228],"construction":[229,251],"natural":[236],"leads":[238],"an":[240],"arguably":[241],"simpler":[242],"prior":[245],"work.":[246],"then":[248],"instrument":[249],"bound":[253],"algorithm.":[258],"To":[259],"argue":[260],"polylogarithmic,":[264],"we":[265],"prove":[266],"number":[269],"subrounds":[271],"takes":[274],"same":[277],"as":[278],"bounds":[280],"static":[283],"MIS.":[284]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-11T00:00:00"}