Jump to content

Talk:Edge disjoint shortest pair algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by KyraVixen (talk | contribs) at 16:43, 22 September 2006 (moved Talk:Edge Disjoint Shortest Pair Algorithm to Talk:Edge disjoint shortest pair algorithm: Renaming per Wikipedia's naming conventions). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The algorithm described here is Suurballe's algorithm. An example is given here: http://www.acreo.com/upload/Publications/Events/GMPLS-PathComp.pdf from page 28. --Walker44 15:20, 28 June 2006 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Edge_disjoint_shortest_pair_algorithm&oldid=77196806"