✦ LIBER ✦

An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs

✍ Scribed by Mrinmoy Hota; Madhumangal Pal; Tapan K. Pal

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for finding a max

✍ Ju Yuan Hsiao; Chuan Yi Tang; Ruay Shiung Chang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 606 KB

An efficient pram algorithm for maximum-

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

An Efficient Algorithm for Finding All H

✍ Bera; Pal; Pal 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 114 KB

Efficient algorithms for the maximum wei

✍ Maw-Shang Chang; Fu-Hsing Wang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 246 KB

An optimal time algorithm for finding a

✍ G. H. Chen; M. T. Kuo; J. P. Sheu 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 147 KB

Genetic algorithmic approach to find the

✍ Sk. Md. Abu Nayeem; Madhumangal Pal 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 213 KB