Shortest path routing/Bibliography

From Citizendium
< Shortest path routing
Revision as of 02:56, 24 December 2009 by imported>David MacQuigg (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 ...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
This article is developed but not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
Catalogs [?]
 
https://en.citizendium.org/wiki/index.php?title=Shortest_path_routing/Bibliography&printable=yes
A list of key readings about Shortest path routing.
Please sort and annotate in a user-friendly manner. For formatting, consider using automated reference wikification.

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 ed, A.S. Tanenbaum, Prentice-Hall 2003.

Section 4.2 "Routing" in "Computer Networks: A Systems Approach", 4th ed, L.L. Peterson, B.S. Davie, Morgann Kaufmann 2007.

Retrieved from "https://citizendium.org/wiki/index.php?title=Shortest_path_routing/Bibliography&oldid=714054"