乐胖代购免代理版

{"id":"https://openalex.org/W2129027417","doi":"https://doi.org/10.1109/iccta.2007.101","title":"Partially Dynamic Concurrent Update of Distributed Shortest Paths","display_name":"Partially Dynamic Concurrent Update of Distributed Shortest Paths","publication_year":2007,"publication_date":"2007-03-01","ids":{"openalex":"https://openalex.org/W2129027417","doi":"https://doi.org/10.1109/iccta.2007.101","mag":"2129027417"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccta.2007.101","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5050291532","display_name":"Gianlorenzo D\u2019Angelo","orcid":"https://orcid.org/0000-0003-0377-7037"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianlorenzo D'Angelo","raw_affiliation_strings":["Dipt. di Ingegneria Elettrica e dell'Informazione, Univ. dell'Aquila, L'Aquila"],"affiliations":[{"raw_affiliation_string":"Dipt. di Ingegneria Elettrica e dell'Informazione, Univ. dell'Aquila, L'Aquila","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090907237","display_name":"Serafino Cicerone","orcid":"https://orcid.org/0000-0001-8893-9335"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Serafino Cicerone","raw_affiliation_strings":["Dipt. di Ingegneria Elettrica e dell'Informazione, Univ. dell'Aquila, L'Aquila"],"affiliations":[{"raw_affiliation_string":"Dipt. di Ingegneria Elettrica e dell'Informazione, Univ. dell'Aquila, L'Aquila","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029633057","display_name":"Gabriele Di Stefano","orcid":"https://orcid.org/0000-0003-4521-8356"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gabriele Di Stefano","raw_affiliation_strings":["Dipt. di Ingegneria Elettrica e dell'Informazione, Univ. dell'Aquila, L'Aquila"],"affiliations":[{"raw_affiliation_string":"Dipt. di Ingegneria Elettrica e dell'Informazione, Univ. dell'Aquila, L'Aquila","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022524777","display_name":"Daniele Frigioni","orcid":"https://orcid.org/0000-0002-2180-8813"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Daniele Frigioni","raw_affiliation_strings":["Dipt. di Ingegneria Elettrica e dell'Informazione, Univ. dell'Aquila, L'Aquila"],"affiliations":[{"raw_affiliation_string":"Dipt. di Ingegneria Elettrica e dell'Informazione, Univ. dell'Aquila, L'Aquila","institution_ids":["https://openalex.org/I26415053"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":6,"citation_normalized_percentile":{"value":0.528102,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":79,"max":80},"biblio":{"volume":null,"issue":null,"first_page":"32","last_page":"38"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998,"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/T12288","display_name":"Optimization and Search Problems","score":0.9992,"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/T10237","display_name":"Cryptography and Data Security","score":0.9985,"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/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.57323194},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5316622}],"concepts":[{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7365664},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6648075},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6574087},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.63237196},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.61669445},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5991448},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.57323194},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5316622},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4470048},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.44221282},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42372838},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42347434},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2792101},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26285887},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.24387714},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.21846333},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08819902},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05605921},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccta.2007.101","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":14,"referenced_works":["https://openalex.org/W1145097660","https://openalex.org/W1557418999","https://openalex.org/W1966441918","https://openalex.org/W1969458082","https://openalex.org/W1982440947","https://openalex.org/W2012456804","https://openalex.org/W2035017516","https://openalex.org/W2049354208","https://openalex.org/W2085197957","https://openalex.org/W2087989168","https://openalex.org/W2168930695","https://openalex.org/W2613173048","https://openalex.org/W2657967087","https://openalex.org/W4251986490"],"related_works":["https://openalex.org/W4307561361","https://openalex.org/W4293054712","https://openalex.org/W2597144308","https://openalex.org/W2523719706","https://openalex.org/W2391130892","https://openalex.org/W2368964068","https://openalex.org/W2360981904","https://openalex.org/W2354846196","https://openalex.org/W2347245430","https://openalex.org/W2030169809"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,6,14,18,27,36,39],"dynamic":[3,79],"version":[4],"of":[5,13],"distributed":[7],"all-pairs":[8],"shortest":[9,54,61,93],"paths":[10,55,94],"problem.":[11],"Most":[12],"solutions":[15],"given":[16],"in":[17],"literature":[19],"for":[20,38],"this":[21,73],"problem,":[22],"either":[23],"(i)":[24],"work":[25],"under":[26],"assumption":[28],"that":[29,46,81],"before":[30],"dealing":[31],"with":[32],"an":[33],"edge":[34],"operation,":[35],"algorithm":[37,80],"previous":[40],"operation":[41],"has":[42],"to":[43,52,90],"be":[44,67],"terminated,":[45],"is,":[47],"they":[48],"are":[49],"not":[50],"able":[51,89],"update":[53,60,92],"concurrently,":[56],"or":[57],"(ii)":[58],"concurrently":[59,91],"paths,":[62],"but":[63],"their":[64],"convergence":[65,97],"can":[66],"very":[68],"slow":[69],"(possibly":[70],"infinite).":[71],"In":[72,85],"paper":[74],"we":[75],"propose":[76],"a":[77],"partially":[78],"overcomes":[82],"these":[83],"limitations.":[84],"particular,":[86],"it":[87],"is":[88,98],"and":[95],"its":[96],"quite":[99],"fast":[100]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2129027417","counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-01-20T11:48:13.431239","created_date":"2016-06-24"}