Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree

Paola Flocchini, Antonio Mesa Enriques, Linda Pagli, Giuseppe Prencipe, Nicola Santoro. Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree. In Jean-Jacques Lévy, Ernst W. Mayr, John C. Mitchell, editors, Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), 22-27 August 2004, Toulouse, France. pages 153-166, Kluwer, 2004.

@inproceedings{FlocchiniEPPS04,
  title = {Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree},
  author = {Paola Flocchini and Antonio Mesa Enriques and Linda Pagli and Giuseppe Prencipe and Nicola Santoro},
  year = {2004},
  tags = {protocol},
  researchr = {https://researchr.org/publication/FlocchiniEPPS04},
  cites = {0},
  citedby = {0},
  pages = {153-166},
  booktitle = {Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), 22-27 August 2004, Toulouse, France},
  editor = {Jean-Jacques Lévy and Ernst W. Mayr and John C. Mitchell},
  publisher = {Kluwer},
  isbn = {1-4020-8140-5},
}