Wikipedia

Talk:Edge disjoint shortest pair algorithm

This is an old revision of this page, as edited by 195.227.74.194 (talk) at 14:40, 27 December 2007 (→Shiortest pair?: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Latest comment: 17 years ago by 195.227.74.194 in topic Shiortest pair?

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

Shiortest pair?

Latest comment: 17 years ago1 comment1 person in discussion

What is the "shortest pair algorithm" entioned in the first step?--195.227.74.194 (talk) 14:40, 27 December 2007 (UTC)Reply

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