✦ LIBER ✦

A computational improvement for a shortest paths ranking algorithm

✍ Scribed by JoséAugusto de Azevedo; Joaquim João E.R. Silvestre Madeira; Ernesto Q. Vieira Martins; Filipe Manuel A. Pires

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for the ranking of shortest

✍ JoséAugusto Azevedo; Maria Emília O. Santos Costa; Joaquim João E.R. Silvestre M 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 631 KB

Computational study of an improved short

✍ Fred Glover; Randy Glover; Darwin Klingman 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 649 KB

A bicriterion shortest path algorithm

✍ João Carlos Namorado Climaco; Ernesto Queirós Vieira Martins 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 386 KB

A shortest path algorithm for grid graph

✍ F. O. Hadlock 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 547 KB

An improved watershed algorithm based on

✍ Víctor Osma-Ruiz; Juan I. Godino-Llorente; Nicolás Sáenz-Lechón; Pedro Gómez-Vil 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 402 KB

Improvements for the Thresh X2 shortest

✍ James J. Divoky 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 447 KB