Distributed Algorithms for AllPairs Shortest Paths and Minimum Diameter Spanning Tree Problems

Franck Butelle, Christian Lavault. Distributed Algorithms for AllPairs Shortest Paths and Minimum Diameter Spanning Tree Problems. In Alain Bui, Vincent Villain, editors, Distributed Computing, 2nd International Conference On Principles Of Distributed Systems. OPODIS 98, Amiens, France, December 16-18, 1998. pages 77-88, Hermes, 1998.

@inproceedings{ButelleL98,
  title = {Distributed Algorithms for AllPairs Shortest Paths and Minimum Diameter Spanning Tree Problems},
  author = {Franck Butelle and Christian Lavault},
  year = {1998},
  researchr = {https://researchr.org/publication/ButelleL98},
  cites = {0},
  citedby = {0},
  pages = {77-88},
  booktitle = {Distributed Computing, 2nd International Conference On Principles Of Distributed Systems. OPODIS 98, Amiens, France, December 16-18, 1998},
  editor = {Alain Bui and Vincent Villain},
  publisher = {Hermes},
  isbn = {2-86601-737-4},
}