Shortest path routing/Bibliography: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

3 February 2011

24 December 2009

  • curprev 03:5603:56, 24 December 2009imported>David MacQuigg 352 bytes +352 New page: {{subpages}} E.W. Dijkstra (1959) "A note on two problems in connexion with graphs", ''Numerische Mathematik'' 1: 269–271. Section 5.2 "Routing Algorithms" in "Computer Networks", 4th ...