✦ LIBER ✦

Minimum node disjoint path covering for circular-arc graphs

✍ Scribed by M.A. Bonuccelli; D.P. Bovet

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient reduction for path problems on

✍ Srinivasa R. Arikati; C. Pandu Rangan; Glenn K. Manacher 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 509 KB

Solving the path cover problem on circul

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

Approximation algorithms for covering a

✍ Shlomo Moran; Ilan Newman; Yaron Wolfstahl 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 464 KB

Solving coloring, minimum clique cover a

✍ Olivier Durand de Gevigney; Frédéric Meunier; Christian Popa; Julien Reygner; Ay 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 318 KB

An optimal parallel algorithm for solvin

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

An optimal algorithm for shortest paths

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