✦ LIBER ✦

Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs

✍ Scribed by Maw-Shang Chang; Fu-Hsing Wang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient pram algorithm for maximum-

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

The weighted maximum independent set pro

✍ Chang-Wu Yu; Gen-Huey Chen 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 543 KB

Sequential and parallel algorithms for t

✍ Ming-Shing Yu; Lin Yu Tseng; Shoe-Jane Chang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

A New Algorithm for the Maximum-Weight C

✍ Patric R.J. Östergård 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 72 KB

A fast algorithm for the maximum weight

✍ L. Babel 📂 Article 📅 1994 🏛 Springer Vienna 🌐 English ⚖ 386 KB

An efficient algorithm for finding a max

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