✦ LIBER ✦

An Optimal Algorithm for thek-Fixed-Endpoint Path Cover on Proper Interval Graphs

✍ Scribed by George B. Mertzios; Walter Unger

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear algorithm for optimal path cover

✍ Srinivasa Rao Arikati; C. Pandu Rangan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Optimal parallel algorithm for shortest-

✍ P. K. Mishra 📂 Article 📅 2004 🏛 SP Zhejiang University Press 🌐 English ⚖ 688 KB

A linear-time algorithm for the k-fixed-

✍ Katerina Asdre; Stavros D. Nikolopoulos 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB 👁 1 views

An optimal algorithm to solve the all-pa

✍ R. Ravi; Madhav V. Marathe; C. Pandu Rangan 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB

An optimal algorithm for shortest paths

✍ M. J. Atallah; D. Z. Chen; D. T. Lee 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 796 KB

An optimal parallel solution for the pat

✍ Katerina Asdre; Stavros D. Nikolopoulos; Charis Papadopoulos 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 479 KB