Virginia Vassilevska, Ryan Williams, Raphael Yuster. All-pairs bottleneck paths for general graphs in truly sub-cubic time. In David S. Johnson, Uriel Feige, editors, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007. pages 585-589, ACM, 2007. [doi]
@inproceedings{VassilevskaWY07,
title = {All-pairs bottleneck paths for general graphs in truly sub-cubic time},
author = {Virginia Vassilevska and Ryan Williams and Raphael Yuster},
year = {2007},
doi = {10.1145/1250790.1250876},
url = {http://doi.acm.org/10.1145/1250790.1250876},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/VassilevskaWY07},
cites = {0},
citedby = {0},
pages = {585-589},
booktitle = {Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007},
editor = {David S. Johnson and Uriel Feige},
publisher = {ACM},
isbn = {978-1-59593-631-8},
}