✦ LIBER ✦

Algorithms for finding an optimal set of short disjoint paths in a communication network

✍ Scribed by Torrieri, D.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding Edge-disjoint Paths in Networks:

✍ Maria J. Blesa; Christian Blum 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 935 KB

A localized algorithm for finding disjoi

✍ Ronghui Hou; Haoshan Shi 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 77 KB

An adaptive stabilizing algorithm for fi

✍ Rachid Hadid; Mehmet Hakan Karaata 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 938 KB

An Algorithm for finding the optimal pat

✍ V.F. Krivorotov 📂 Article 📅 1975 🏛 Elsevier Science ⚖ 648 KB

An algorithm for finding the k quickest

✍ Y.L. Chen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 652 KB

An algorithm for enumerating all simple

✍ R.B. Misra 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 235 KB