{"id":"https://openalex.org/W1563915760","doi":"https://doi.org/10.1007/11841036_65","title":"Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?","display_name":"Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1563915760","doi":"https://doi.org/10.1007/11841036_65","mag":"1563915760"},"language":"en","primary_location":{"id":"doi:10.1007/11841036_65","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11841036_65","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"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/A5066534034","display_name":"Camil Demetrescu","orcid":"https://orcid.org/0000-0002-4686-6745"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"C. Demetrescu","raw_affiliation_strings":["Dip. di Informatica e Sistemistica, Univ. Roma \u201cLa Sapienza\u201d, Italy","Dip. di Informatica e Sistemistica, Univ. Roma \"La Sapienza\", Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dip. di Informatica e Sistemistica, Univ. Roma \u201cLa Sapienza\u201d, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Dip. di Informatica e Sistemistica, Univ. Roma \"La Sapienza\", Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077461578","display_name":"Pompeo Faruolo","orcid":null},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"P. Faruolo","raw_affiliation_strings":["Dip. di Informatica ed Applicazioni, Univ. Salerno, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dip. di Informatica ed Applicazioni, Univ. Salerno, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086186456","display_name":"Giuseppe F. Italiano","orcid":"https://orcid.org/0000-0002-9492-9894"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"G. F. Italiano","raw_affiliation_strings":["Dip. di Informatica, Sistemi e Produzione, Univ. Roma \u201cTor Vergata\u201d, Italy","Dip. di Informatica, Sistemi e Produzione, Univ. Roma \"Tor Vergata\", Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dip. di Informatica, Sistemi e Produzione, Univ. Roma \u201cTor Vergata\u201d, Italy","institution_ids":["https://openalex.org/I116067653"]},{"raw_affiliation_string":"Dip. di Informatica, Sistemi e Produzione, Univ. Roma \"Tor Vergata\", Italy","institution_ids":["https://openalex.org/I116067653"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Thorup","raw_affiliation_strings":["AT&T Labs-Research, 180 Park Avenue, Florham Park, NJ, 07932, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs-Research, 180 Park Avenue, Florham Park, NJ, 07932, USA","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2944,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.42920282,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"732","last_page":"743"},"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.9980000257492065,"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.9980000257492065,"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/T11106","display_name":"Data Management and Algorithms","score":0.9921000003814697,"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/T12288","display_name":"Optimization and Search Problems","score":0.9918000102043152,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8033844828605652},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7880386114120483},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.6854296326637268},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5333366990089417},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.49336257576942444},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4921650290489197},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4790973961353302},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.47216957807540894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4463570713996887},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4254035949707031},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4003859758377075},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35787516832351685},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.29949820041656494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16194313764572144},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12249940633773804}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8033844828605652},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7880386114120483},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.6854296326637268},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5333366990089417},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.49336257576942444},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4921650290489197},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4790973961353302},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.47216957807540894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4463570713996887},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4254035949707031},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4003859758377075},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35787516832351685},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.29949820041656494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16194313764572144},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12249940633773804},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/11841036_65","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11841036_65","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:iris.uniroma1.it:11573/50578","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/50578","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1499442191","https://openalex.org/W1512043027","https://openalex.org/W1517449616","https://openalex.org/W1518021176","https://openalex.org/W1543611576","https://openalex.org/W1550136763","https://openalex.org/W1554407673","https://openalex.org/W1580018210","https://openalex.org/W1982440947","https://openalex.org/W1983179262","https://openalex.org/W1991778515","https://openalex.org/W2004317773","https://openalex.org/W2063896698","https://openalex.org/W2084888995","https://openalex.org/W2096655151","https://openalex.org/W2115271283","https://openalex.org/W2132523953","https://openalex.org/W2169528473","https://openalex.org/W2602645338","https://openalex.org/W2615963353","https://openalex.org/W3163016511"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W2237480599","https://openalex.org/W2018146256","https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2375775343","https://openalex.org/W4299588719","https://openalex.org/W2020255949","https://openalex.org/W1817899449","https://openalex.org/W3184816460"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}