Flow Networks and Combinatorial Operations

← Back to topic

Authors: Edsger W. Dijkstra
Year: 1959
Journal: Numerische Mathematik
DOI: 10.1007/BF01386390
Publisher: https://link.springer.com/article/10.1007/BF01386390

Keywords: dijkstra, shortest path

Abstract

A note on two problems in connexion with graphs.

Cite this paper

bibtex

@misc{dijkstra1959,
  title  = {Flow Networks and Combinatorial Operations},
  author = {Edsger W. Dijkstra},
  year   = {1959},
  journal = {Numerische Mathematik},
  doi    = {10.1007/BF01386390},
  url    = {https://doi.org/10.1007/BF01386390},
}

Source files

[metadata.json](https://raw.githubusercontent.com/badhope/ScholarLib/main/papers/computer-science/Algorithms-Data-Structures/Graph-Algorithms/2019-and-earlier/Numerische Mathematik/empirical/graph/dijkstra/metadata.json)
[paper.bib](https://raw.githubusercontent.com/badhope/ScholarLib/main/papers/computer-science/Algorithms-Data-Structures/Graph-Algorithms/2019-and-earlier/Numerische Mathematik/empirical/graph/dijkstra/paper.bib)