{"id":"https://openalex.org/W2471659732","doi":"https://doi.org/10.1145/2949689.2949713","title":"Efficient Maintenance of All-Pairs Shortest Distances","display_name":"Efficient Maintenance of All-Pairs Shortest Distances","publication_year":2016,"publication_date":"2016-07-08","ids":{"openalex":"https://openalex.org/W2471659732","doi":"https://doi.org/10.1145/2949689.2949713","mag":"2471659732"},"language":"en","primary_location":{"id":"doi:10.1145/2949689.2949713","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2949689.2949713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th International Conference on Scientific and Statistical Database Management","raw_type":"proceedings-article"},"type":"conference-paper","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/A5031964906","display_name":"Sergio Greco","orcid":"https://orcid.org/0000-0003-2966-3484"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Sergio Greco","raw_affiliation_strings":["DIMES, University of Calabria, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DIMES, University of Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039727555","display_name":"Cristian Molinaro","orcid":"https://orcid.org/0000-0003-4103-1084"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Cristian Molinaro","raw_affiliation_strings":["DIMES, University of Calabria, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DIMES, University of Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091798914","display_name":"Chiara Pulice","orcid":"https://orcid.org/0000-0001-5449-9044"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Chiara Pulice","raw_affiliation_strings":["DIMES, University of Calabria, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DIMES, University of Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9991999864578247,"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.6844473481178284},{"id":"https://openalex.org/keywords/scratch","display_name":"Scratch","score":0.49524059891700745},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4834826588630676},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46120116114616394},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4517202079296112},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35311445593833923},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3357269763946533},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23517438769340515},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06849470734596252}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6844473481178284},{"id":"https://openalex.org/C2781235140","wikidata":"https://www.wikidata.org/wiki/Q275131","display_name":"Scratch","level":2,"score":0.49524059891700745},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4834826588630676},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46120116114616394},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4517202079296112},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35311445593833923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3357269763946533},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23517438769340515},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06849470734596252}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2949689.2949713","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2949689.2949713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th International Conference on Scientific and Statistical Database Management","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":44,"referenced_works":["https://openalex.org/W1499442191","https://openalex.org/W1512819151","https://openalex.org/W1542191788","https://openalex.org/W1554407673","https://openalex.org/W1810931192","https://openalex.org/W1829285201","https://openalex.org/W1964653060","https://openalex.org/W1975344016","https://openalex.org/W1982440947","https://openalex.org/W1982943597","https://openalex.org/W1989632610","https://openalex.org/W1991778515","https://openalex.org/W1996982345","https://openalex.org/W2005945380","https://openalex.org/W2006097619","https://openalex.org/W2008570937","https://openalex.org/W2012670464","https://openalex.org/W2015725509","https://openalex.org/W2019003829","https://openalex.org/W2022218646","https://openalex.org/W2035586680","https://openalex.org/W2037034819","https://openalex.org/W2041916017","https://openalex.org/W2048098617","https://openalex.org/W2058426370","https://openalex.org/W2081863845","https://openalex.org/W2084888995","https://openalex.org/W2094515718","https://openalex.org/W2096304152","https://openalex.org/W2098636939","https://openalex.org/W2118446779","https://openalex.org/W2123966888","https://openalex.org/W2126166149","https://openalex.org/W2137152603","https://openalex.org/W2142126162","https://openalex.org/W2152776677","https://openalex.org/W2154713079","https://openalex.org/W2156431918","https://openalex.org/W2159394589","https://openalex.org/W2169528473","https://openalex.org/W2172107427","https://openalex.org/W2623150993","https://openalex.org/W2764587448","https://openalex.org/W3022326557"],"related_works":["https://openalex.org/W2475116013","https://openalex.org/W2770018148","https://openalex.org/W2358308169","https://openalex.org/W2385135707","https://openalex.org/W2140315382","https://openalex.org/W2059109728","https://openalex.org/W2082556335","https://openalex.org/W322691623","https://openalex.org/W2494989134","https://openalex.org/W2509444723"],"abstract_inverted_index":{"Computing":[0],"shortest":[1,17,34],"distances":[2,18,35],"is":[3,13],"a":[4],"central":[5],"task":[6],"in":[7],"many":[8,26],"graph":[9,24],"applications.":[10],"Since":[11],"it":[12],"impractical":[14],"to":[15,31],"recompute":[16],"from":[19],"scratch":[20],"every":[21],"time":[22],"the":[23],"changes,":[25],"algorithms":[27],"have":[28],"been":[29],"proposed":[30],"incrementally":[32],"maintain":[33],"after":[36],"edge":[37],"deletions":[38],"or":[39],"insertions.":[40]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}