Reference for fast algorithm for bottleneck shortest paths I am looking for a good reference for bottleneck shortest paths.  Specifically, given vertices s and t in an undirected graph with edge weights, you want the shortest path from s to t, where the length of a path is the maximum edge on that path.  This can be solved in O(n+m) time by finding the median edge weight and (carefully) recursively deleting half the edges. 


  Does anyone know a reference for
  this?
P. M. Camerini (1978), The min-max spanning tree problem and some extensions, Information Processing Letters 7 (1): 10–14, doi:10.1016/0020-0190(78)90030-3