✦ LIBER ✦

An optimal parallel solution for the path cover problem on -sparse graphs

✍ Scribed by Katerina Asdre; Stavros D. Nikolopoulos; Charis Papadopoulos

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

A time-optimal solution for the path cov

✍ Koji Nakano; Stephan Olariu; Albert Y. Zomaya 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Optimal parallel algorithm for shortest-

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

An optimal parallel algorithm for solvin

✍ Anita Saha; Madhumangal Pal; Tapan K. Pal 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 232 KB

An optimal parallel algorithm for the mi

✍ Mikhail J. Atallah; Danny Z. Chen 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 567 KB

An Optimal Algorithm for thek-Fixed-Endp

✍ George B. Mertzios; Walter Unger 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 393 KB