Distributed Algorithms for Network Diameter and Girth

David Peleg, Liam Roditty, Elad Tal. Distributed Algorithms for Network Diameter and Girth. In Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer, editors, Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II. Volume 7392 of Lecture Notes in Computer Science, pages 660-672, Springer, 2012. [doi]

@inproceedings{PelegRT12,
  title = {Distributed Algorithms for Network Diameter and Girth},
  author = {David Peleg and Liam Roditty and Elad Tal},
  year = {2012},
  doi = {10.1007/978-3-642-31585-5_58},
  url = {http://dx.doi.org/10.1007/978-3-642-31585-5_58},
  researchr = {https://researchr.org/publication/PelegRT12},
  cites = {0},
  citedby = {0},
  pages = {660-672},
  booktitle = {Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II},
  editor = {Artur Czumaj and Kurt Mehlhorn and Andrew M. Pitts and Roger Wattenhofer},
  volume = {7392},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-31584-8},
}