A note on two problems in connexion with graphs Export

@article{dijkstra59a, abstract = {We consider a graph with n vertices, all pairs of which are connected by an edge; each edge is of given positive length. The following two basic problems are solved. Problem 1: construct the tree of minimal total length between the n vertices. (A tree is a graph with one and only one path between any two vertices.) Problem 2: find the path of minimal total length between two given vertices.}, author = {Dijkstra, Edsger W.}, citeulike-article-id = {1586011}, citeulike-linkout-0 = {http://jmvidal.cse.sc.edu/papers/dijkstra59a.pdf}, journal = {Numerische Mathematik}, keywords = {algorithms, bibtex-import, distributed}, pages = {269--271}, posted-at = {2007-08-23 14:42:29}, priority = {2}, title = {A note on two problems in connexion with graphs}, url = {http://jmvidal.cse.sc.edu/papers/dijkstra59a.pdf}, volume = {1}, year = {1959} }

TY - JOUR ID - dijkstra59a L3 - citeulike-article-id:1586011 N2 - We consider a graph with n vertices, all pairs of which are connected by an edge; each edge is of given positive length. The following two basic problems are solved. Problem 1: construct the tree of minimal total length between the n vertices. (A tree is a graph with one and only one path between any two vertices.) Problem 2: find the path of minimal total length between two given vertices. JF - Numerische Mathematik EP - 271 TI - A note on two problems in connexion with graphs VL - 1 SP - 269 KW - algorithms KW - bibtex-import KW - distributed AU - Dijkstra, Edsger PY - 1959/// UR - http://jmvidal.cse.sc.edu/papers/dijkstra59a.pdf ER -