New Bounds on the Complexity of the Shortest Path Problem

Michael L. Fredman. New Bounds on the Complexity of the Shortest Path Problem. SIAM Journal on Computing, 5(1):83-89, 1976.

@article{Fredman76:0,
  title = {New Bounds on the Complexity of the Shortest Path Problem},
  author = {Michael L. Fredman},
  year = {1976},
  researchr = {https://researchr.org/publication/Fredman76%3A0},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {5},
  number = {1},
  pages = {83-89},
}