Talk:Edge disjoint shortest pair algorithm: Difference between revisions

Content deleted Content added
SineBot (talk | contribs)
m Signing comment by 129.192.170.250 - ""
Cewbot (talk | contribs)
m Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Stub" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{WikiProject Computing}}.
 
Line 1:
{{WikiProject Computingbanner shell|class=Stub|1=
{{WikiProject Computing|importance=|network=yes|auto=yes}}
}}
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. --[[User:Walker44|Walker44]] 15:20, 28 June 2006 (UTC)