{"id":"https://openalex.org/W7148259276","doi":"https://doi.org/10.1109/hipcw66559.2025.00077","title":"Fast and Accurate MIS on Dynamic Graphs","display_name":"Fast and Accurate MIS on Dynamic Graphs","publication_year":2025,"publication_date":"2025-12-17","ids":{"openalex":"https://openalex.org/W7148259276","doi":"https://doi.org/10.1109/hipcw66559.2025.00077"},"language":null,"primary_location":{"id":"doi:10.1109/hipcw66559.2025.00077","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipcw66559.2025.00077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 32nd International Conference on High Performance Computing, Data and Analytics Workshop (HiPCW)","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/A5120943164","display_name":"Agam Harpreet Singh","orcid":null},"institutions":[{"id":"https://openalex.org/I154549908","display_name":"Indian Institute of Technology Jodhpur","ror":"https://ror.org/03yacj906","country_code":"IN","type":"education","lineage":["https://openalex.org/I154549908"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Agam Harpreet Singh","raw_affiliation_strings":["Indian Institute of Technology Jodhpur, NH62, Karwar,Department of Computer Science and Engineering,Jodhpur,Rajasthan,India,342030"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Jodhpur, NH62, Karwar,Department of Computer Science and Engineering,Jodhpur,Rajasthan,India,342030","institution_ids":["https://openalex.org/I154549908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047343683","display_name":"Neha Sharma","orcid":"https://orcid.org/0000-0002-2798-4025"},"institutions":[{"id":"https://openalex.org/I154549908","display_name":"Indian Institute of Technology Jodhpur","ror":"https://ror.org/03yacj906","country_code":"IN","type":"education","lineage":["https://openalex.org/I154549908"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Neha Sharma","raw_affiliation_strings":["Indian Institute of Technology Jodhpur, NH62, Karwar,Department of Computer Science and Engineering,Jodhpur,Rajasthan,India,342030"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Jodhpur, NH62, Karwar,Department of Computer Science and Engineering,Jodhpur,Rajasthan,India,342030","institution_ids":["https://openalex.org/I154549908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5116479454","display_name":"Aditya Trivedi","orcid":null},"institutions":[{"id":"https://openalex.org/I154549908","display_name":"Indian Institute of Technology Jodhpur","ror":"https://ror.org/03yacj906","country_code":"IN","type":"education","lineage":["https://openalex.org/I154549908"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Aditya Trivedi","raw_affiliation_strings":["Indian Institute of Technology Jodhpur, NH62, Karwar,Department of Computer Science and Engineering,Jodhpur,Rajasthan,India,342030"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Jodhpur, NH62, Karwar,Department of Computer Science and Engineering,Jodhpur,Rajasthan,India,342030","institution_ids":["https://openalex.org/I154549908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002481103","display_name":"Dip Sankar Banerjee","orcid":"https://orcid.org/0000-0002-0476-1224"},"institutions":[{"id":"https://openalex.org/I154549908","display_name":"Indian Institute of Technology Jodhpur","ror":"https://ror.org/03yacj906","country_code":"IN","type":"education","lineage":["https://openalex.org/I154549908"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Dip Sankar Banerjee","raw_affiliation_strings":["Indian Institute of Technology Jodhpur, NH62, Karwar,Department of Computer Science and Engineering,Jodhpur,Rajasthan,India,342030"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Jodhpur, NH62, Karwar,Department of Computer Science and Engineering,Jodhpur,Rajasthan,India,342030","institution_ids":["https://openalex.org/I154549908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5120943164"],"corresponding_institution_ids":["https://openalex.org/I154549908"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.7540657,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"245","last_page":"246"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.28279998898506165,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.28279998898506165,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.09179999679327011,"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.07090000063180923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6545000076293945},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5593000054359436},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48579999804496765},{"id":"https://openalex.org/keywords/dynamic-data","display_name":"Dynamic data","score":0.4129999876022339},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.4083000123500824},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.3337000012397766}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7441999912261963},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6545000076293945},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5593000054359436},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48579999804496765},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4438999891281128},{"id":"https://openalex.org/C197298091","wikidata":"https://www.wikidata.org/wiki/Q5318963","display_name":"Dynamic data","level":2,"score":0.4129999876022339},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.4083000123500824},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39959999918937683},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36730000376701355},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3337000012397766},{"id":"https://openalex.org/C2781235140","wikidata":"https://www.wikidata.org/wiki/Q275131","display_name":"Scratch","level":2,"score":0.3330000042915344},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.33070001006126404},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.30790001153945923},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.2946999967098236},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.26080000400543213}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hipcw66559.2025.00077","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipcw66559.2025.00077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 32nd International Conference on High Performance Computing, Data and Analytics Workshop (HiPCW)","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":4,"referenced_works":["https://openalex.org/W2026143151","https://openalex.org/W2071114738","https://openalex.org/W2903686141","https://openalex.org/W2963645943"],"related_works":[],"abstract_inverted_index":{"A":[0],"Maximal":[1],"Independent":[2],"Set":[3],"(MIS)":[4],"is":[5,32],"a":[6,64],"challenging":[7],"problem":[8],"due":[9],"to":[10,50,82],"its":[11],"high":[12],"search":[13],"space.":[14],"In":[15],"dynamic":[16,41,86],"graphs":[17,35],"where":[18],"edge/vertex":[19],"updates":[20,75],"are":[21,48],"frequent,":[22],"maintaining":[23],"MIS":[24,29,46,66],"becomes":[25],"more":[26],"difficult.":[27],"Recomputing":[28],"from":[30],"scratch":[31],"infeasible":[33],"when":[34],"undergo":[36],"frequent":[37],"structural":[38],"updates.":[39],"Parallel":[40],"algorithms,":[42],"although":[43],"they":[44],"maintain":[45],"quickly,":[47],"prone":[49],"producing":[51],"inaccurate":[52],"results":[53,92],"because":[54],"of":[55],"race":[56],"conditions.":[57],"To":[58],"overcome":[59],"these":[60],"challenges,":[61],"we":[62],"propose":[63],"BFS-based":[65],"maintenance":[67],"algorithm":[68,89],"that":[69],"works":[70],"by":[71],"grouping":[72],"possible":[73],"race-conflicting":[74],"and":[76,93],"executing":[77],"them":[78],"in":[79],"order.":[80],"Compared":[81],"the":[83],"parallel":[84],"batch":[85],"technique,":[87],"our":[88],"produces":[90],"accurate":[91],"achieves":[94],"32.4\u00d7":[95],"speedup":[96],"over":[97],"state-of-the-art":[98],"static":[99],"graph":[100],"algorithms.":[101]},"counts_by_year":[],"updated_date":"2026-04-03T16:44:17.987007","created_date":"2026-04-03T00:00:00"}