Timothy M. Chan. All-pairs shortest paths for unweighted undirected graphs in ::::o(mn):::: time. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006. pages 514-523, ACM Press, 2006. [doi]
@inproceedings{Chan06:5,
title = {All-pairs shortest paths for unweighted undirected graphs in ::::o(mn):::: time},
author = {Timothy M. Chan},
year = {2006},
doi = {10.1145/1109557.1109614},
url = {http://doi.acm.org/10.1145/1109557.1109614},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Chan06%3A5},
cites = {0},
citedby = {0},
pages = {514-523},
booktitle = {Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006},
publisher = {ACM Press},
isbn = {0-89871-605-5},
}