{"id":"https://openalex.org/W4313463099","doi":"https://doi.org/10.1145/3571306.3571359","title":"A Parallel Framework for Efficiently Updating Graph Properties in Large Dynamic Networks","display_name":"A Parallel Framework for Efficiently Updating Graph Properties in Large Dynamic Networks","publication_year":2023,"publication_date":"2023-01-03","ids":{"openalex":"https://openalex.org/W4313463099","doi":"https://doi.org/10.1145/3571306.3571359"},"language":"en","primary_location":{"id":"doi:10.1145/3571306.3571359","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3571306.3571359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th International Conference on Distributed Computing and Networking","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/A5032540101","display_name":"Arindam Khanda","orcid":"https://orcid.org/0000-0003-3364-8914"},"institutions":[{"id":"https://openalex.org/I20382870","display_name":"Missouri University of Science and Technology","ror":"https://ror.org/00scwqd12","country_code":"US","type":"education","lineage":["https://openalex.org/I20382870"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arindam Khanda","raw_affiliation_strings":["Missouri University of Science and Technology, United States"],"raw_orcid":"https://orcid.org/0000-0003-3364-8914","affiliations":[{"raw_affiliation_string":"Missouri University of Science and Technology, United States","institution_ids":["https://openalex.org/I20382870"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050881965","display_name":"Sajal K. Das","orcid":"https://orcid.org/0000-0002-9471-0868"},"institutions":[{"id":"https://openalex.org/I20382870","display_name":"Missouri University of Science and Technology","ror":"https://ror.org/00scwqd12","country_code":"US","type":"education","lineage":["https://openalex.org/I20382870"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sajal K. Das","raw_affiliation_strings":["Missouri University of Science and Technology, USA"],"raw_orcid":"https://orcid.org/0000-0002-9471-0868","affiliations":[{"raw_affiliation_string":"Missouri University of Science and Technology, USA","institution_ids":["https://openalex.org/I20382870"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032540101"],"corresponding_institution_ids":["https://openalex.org/I20382870"],"apc_list":null,"apc_paid":null,"fwci":0.1177,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.35287515,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"298","last_page":"299"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9923999905586243,"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/T11478","display_name":"Caching and Content Delivery","score":0.9922999739646912,"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/computer-science","display_name":"Computer science","score":0.8002684116363525},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6914454698562622},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.538214385509491},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5377552509307861},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4950534403324127},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4597267508506775},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4503924250602722},{"id":"https://openalex.org/keywords/topological-graph-theory","display_name":"Topological graph theory","score":0.41800931096076965},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34884941577911377},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3331493139266968},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.159263014793396},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12931400537490845},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10108011960983276}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8002684116363525},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6914454698562622},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.538214385509491},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5377552509307861},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4950534403324127},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4597267508506775},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4503924250602722},{"id":"https://openalex.org/C157406716","wikidata":"https://www.wikidata.org/wiki/Q4115842","display_name":"Topological graph theory","level":5,"score":0.41800931096076965},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34884941577911377},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3331493139266968},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.159263014793396},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12931400537490845},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10108011960983276}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3571306.3571359","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3571306.3571359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1748645781","display_name":null,"funder_award_id":"OAC-1725755, OAC-2104078","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2951135776","https://openalex.org/W3171745483","https://openalex.org/W3212961858","https://openalex.org/W4286485293"],"related_works":["https://openalex.org/W2787993192","https://openalex.org/W2158269427","https://openalex.org/W4381280689","https://openalex.org/W2847365777","https://openalex.org/W3128025644","https://openalex.org/W2355048207","https://openalex.org/W2750422482","https://openalex.org/W4387860419","https://openalex.org/W2267666206","https://openalex.org/W2498592833"],"abstract_inverted_index":{"Graph":[0],"queries":[1],"on":[2,71],"large":[3,72,136],"networks":[4,138],"leverage":[5],"the":[6,21,27,47,97,129,141],"stored":[7],"graph":[8,22,29,54,69],"properties":[9,42,70,134],"to":[10,45,52,67,79],"provide":[11],"faster":[12,139],"results.":[13],"Since":[14],"real-world":[15],"graphs":[16],"are":[17],"mostly":[18],"dynamic,":[19],"i.e.,":[20],"topology":[23],"changes":[24],"over":[25,33],"time,":[26],"corresponding":[28],"attributes":[30],"also":[31],"change":[32],"time.":[34],"In":[35],"certain":[36],"situations,":[37],"recompiling":[38],"or":[39],"updating":[40,83],"earlier":[41],"is":[43],"necessary":[44],"maintain":[46],"accuracy":[48],"of":[49,96],"a":[50,53,60],"response":[51],"query.":[55],"Here,":[56],"we":[57,93,112],"first":[58],"propose":[59,94],"generic":[61],"framework":[62,78],"for":[63,82,121],"developing":[64],"parallel":[65],"algorithms":[66,81,99,120,131],"update":[68,119,133],"dynamic":[73,137],"networks.":[74],"We":[75],"use":[76],"our":[77,114],"develop":[80],"Single":[84],"Source":[85],"Shortest":[86],"Path":[87],"(SSSP)":[88],"and":[89,116,125],"Vertex":[90],"Color.":[91],"Then":[92],"applications":[95],"developed":[98,130],"in":[100,135],"Unmanned":[101],"Aerial":[102],"Vehicle":[103],"(UAV)":[104],"based":[105],"delivery":[106],"systems":[107],"under":[108],"time-varying":[109],"dynamics.":[110],"Finally,":[111],"implement":[113],"SSSP":[115],"vertex":[117],"color":[118],"Nvidia":[122],"GPU":[123],"architecture":[124],"show":[126],"empirically":[127],"that":[128],"can":[132],"than":[140],"state-of-the-art":[142],"techniques.":[143]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}