Talk:Edge disjoint shortest pair algorithm

This is an old revision of this page, as edited by Walker44 (talk | contribs) at 15:20, 28 June 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Latest comment: 19 years ago by Walker44

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