{"id":"https://openalex.org/W1586038047","doi":"https://doi.org/10.1007/1-4020-8141-3_14","title":"Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree","display_name":"Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree","publication_year":2006,"publication_date":"2006-02-21","ids":{"openalex":"https://openalex.org/W1586038047","doi":"https://doi.org/10.1007/1-4020-8141-3_14","mag":"1586038047"},"language":"en","primary_location":{"id":"doi:10.1007/1-4020-8141-3_14","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_14","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F1-4020-8141-3_14.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007%2F1-4020-8141-3_14.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030360680","display_name":"Paola Flocchini","orcid":"https://orcid.org/0000-0003-3584-5727"},"institutions":[{"id":"https://openalex.org/I153718931","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16","country_code":"CA","type":"education","lineage":["https://openalex.org/I153718931"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Paola Flocchini","raw_affiliation_strings":["University of Ottawa, Canada","University of Ottawa"],"affiliations":[{"raw_affiliation_string":"University of Ottawa, Canada","institution_ids":["https://openalex.org/I153718931"]},{"raw_affiliation_string":"University of Ottawa","institution_ids":["https://openalex.org/I153718931"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090828773","display_name":"Antonio Mesa Enriques","orcid":null},"institutions":[{"id":"https://openalex.org/I2656126","display_name":"University of Havana","ror":"https://ror.org/04204gr61","country_code":"CU","type":"education","lineage":["https://openalex.org/I2656126"]}],"countries":["CU"],"is_corresponding":false,"raw_author_name":"Antonio Mesa Enriques","raw_affiliation_strings":["Universidad de la Habana, Cuba","Universidad de La Habana"],"affiliations":[{"raw_affiliation_string":"Universidad de la Habana, Cuba","institution_ids":["https://openalex.org/I2656126"]},{"raw_affiliation_string":"Universidad de La Habana","institution_ids":["https://openalex.org/I2656126"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073016367","display_name":"Linda Pagli","orcid":"https://orcid.org/0000-0003-3717-3952"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Linda Pagli","raw_affiliation_strings":["Universit\u00e0 di pisa, Italy","Universit\u00e0 di Pisa,"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Universit\u00e0 di Pisa,","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031863470","display_name":"Giuseppe Prencipe","orcid":"https://orcid.org/0000-0001-5646-7388"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giuseppe Prencipe","raw_affiliation_strings":["Universit\u00e0 di pisa, Italy","Universit\u00e0 di Pisa,"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Universit\u00e0 di Pisa,","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044260252","display_name":"Nicola Santoro","orcid":"https://orcid.org/0000-0002-7954-3918"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Nicola Santoro","raw_affiliation_strings":["Carleton University, Canada","(Carleton University)"],"affiliations":[{"raw_affiliation_string":"Carleton University, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"(Carleton University)","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5030360680"],"corresponding_institution_ids":["https://openalex.org/I153718931"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.14072881,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"153","last_page":"166"},"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.9961000084877014,"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.9961000084877014,"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/T12288","display_name":"Optimization and Search Problems","score":0.9922000169754028,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9872999787330627,"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.844261884689331},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6553193926811218},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.638247549533844},{"id":"https://openalex.org/keywords/swap","display_name":"Swap (finance)","score":0.6173373460769653},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.508983850479126},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5020608901977539},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4923046827316284},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4538714289665222},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4435109794139862},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.38209328055381775},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31616902351379395},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2840588688850403},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2721335291862488},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2485448718070984},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.21608197689056396},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1600027084350586},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1401393711566925}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.844261884689331},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6553193926811218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.638247549533844},{"id":"https://openalex.org/C99821215","wikidata":"https://www.wikidata.org/wiki/Q1136583","display_name":"Swap (finance)","level":2,"score":0.6173373460769653},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.508983850479126},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5020608901977539},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4923046827316284},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4538714289665222},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4435109794139862},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38209328055381775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31616902351379395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2840588688850403},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2721335291862488},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2485448718070984},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.21608197689056396},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1600027084350586},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1401393711566925},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/1-4020-8141-3_14","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_14","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F1-4020-8141-3_14.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.144.3601","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.3601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sbrinz.di.unipi.it/~peppe/Articoli/Conferenze/2004-TCS.pdf","raw_type":"text"},{"id":"pmh:oai:arpi.unipi.it:11568/190392","is_oa":false,"landing_page_url":"http://hdl.handle.net/11568/190392","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"doi:10.1007/1-4020-8141-3_14","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_14","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F1-4020-8141-3_14.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320310630","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16"},{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1586038047.pdf","grobid_xml":"https://content.openalex.org/works/W1586038047.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W119645300","https://openalex.org/W172665764","https://openalex.org/W1966441918","https://openalex.org/W2007776707","https://openalex.org/W2021542397","https://openalex.org/W2023658462","https://openalex.org/W2046018957","https://openalex.org/W2059015573","https://openalex.org/W2097740541","https://openalex.org/W2135810626"],"related_works":["https://openalex.org/W2962525871","https://openalex.org/W2523719706","https://openalex.org/W2149927264","https://openalex.org/W2951475756","https://openalex.org/W2198982833","https://openalex.org/W2365712669","https://openalex.org/W2357391150","https://openalex.org/W2358754422","https://openalex.org/W2159815887","https://openalex.org/W2382663043"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,6,36,43,47,56,62,65,68,72,79,91,97,134,153,169,172,178,181,193,197],"problem":[3,16],"of":[4,10,30,96,138,150,165,180,195],"computing":[5,133],"optimal":[7,123,135],"swap":[8,119,136],"edges":[9,137],"a":[11,31,139,147],"shortest-path":[12,25,80,140,182,198],"tree.":[13,141,199],"This":[14],"theoretical":[15],"arises":[17],"in":[18,20,28],"practice":[19],"systems":[21,158],"that":[22,53,159],"offer":[23],"point-of-failure":[24],"rerouting":[26],"service":[27],"presence":[29],"single":[32],"link":[33],"failure:":[34],"if":[35],"shortest":[37],"path":[38],"is":[39,102,155,171,185],"not":[40,121],"affected":[41],"by":[42,168],"failed":[44],"link,":[45],"then":[46,75],"message":[48,63,73],"will":[49,58,74],"be":[50,76],"delivered":[51],"through":[52,78],"path;":[54],"otherwise,":[55],"system":[57],"guarantee":[59],"that,":[60],"when":[61],"reaches":[64],"node":[66],"where":[67],"failure":[69],"has":[70],"occurred,":[71],"rerouted":[77],"to":[81],"its":[82],"destination.":[83],"There":[84],"exist":[85],"highly":[86],"efficient":[87,107,129],"serial":[88],"solutions":[89],"for":[90,110,117,132,157],"problem,":[92],"but":[93],"unfortunately":[94],"because":[95],"structures":[98],"they":[99],"use,":[100],"there":[101],"no":[103,186],"known":[104],"(nor":[105],"foreseeable)":[106],"distributed":[108,113,130],"implementation":[109],"them.":[111],"A":[112],"protocol":[114],"exists":[115],"only":[116],"finding":[118],"edges,":[120],"necessarily":[122],"ones.We":[124],"present":[125],"two":[126],"simple":[127],"and":[128,174,188],"algorithms":[131],"One":[142],"algorithm":[143],"uses":[144],"messages":[145],"containing":[146],"constant":[148],"amount":[149,164],"information,":[151],"while":[152],"other":[154],"tailored":[156],"allow":[160],"long":[161],"messages.":[162],"The":[163],"data":[166],"transferred":[167],"protocols":[170],"same":[173],"depends":[175],"on":[176,177],"structure":[179],"spanning-tree;":[183],"it":[184],"more,":[187],"sometimes":[189],"significantly":[190],"less,":[191],"than":[192],"cost":[194],"constructing":[196]},"counts_by_year":[{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}