✦ LIBER ✦

An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs

✍ Scribed by Mondal, Sukumar; Pal, Madhumangal; Pal, Tapan K.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Linear algorithm for optimal path cover

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

An Optimal Algorithm to Solve the All-Pa

✍ Sukumar Mondal; Madhumangal Pal; Tapan K. Pal 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 89 KB

An efficient algorithm to solve connecti

✍ Prabir K. Ghosh; Madhumangal Pal 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 224 KB

An Optimal Algorithm for thek-Fixed-Endp

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

Solving the path cover problem on circul

✍ Ruo-Wei Hung; Maw-Shang Chang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 336 KB