𝔖 Bobbio Scriptorium

✦ LIBER ✦

An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs

✍ Scribed by Teresa Gomes; José Craveirinha; Luísa Jorge

Book ID: 108105876
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 632 KB
Volume: 36
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2008.04.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE 2008 IEEE International Symposium

[IEEE 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) - Sydney, Australia (2008.12.10-2008.12.12)] 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications - A Task Parallel Algorithm for Computing the Costs of All-Pairs Shortest Paths on the CUDA-Compatible GPU

✍ Okuyama, Tomohiro; Ino, Fumihiko; Hagihara, Kenichi 📂 Article 📅 2008 🏛 IEEE ⚖ 643 KB