✦ LIBER ✦

k -Neighborhood-Covering and -Independence Problems for Chordal Graphs

✍ Scribed by Hwang, Shiow-Fen; Chang, Gerard J.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum k-colorable subgraph problem

✍ Mihalis Yannakakis; Fanica Gavril 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 390 KB

The weighted independent domination prob

✍ Gerard J. Chang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 157 KB

On the complexity of the sandwich proble

✍ C.M.H. de Figueiredo; L. Faria; S. Klein; R. Sritharan 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 722 KB

Qualitative independence and Sperner pro

✍ L Gargano; J Körner; U Vaccaro 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 894 KB

Tractability of Parameterized Completion

✍ Kaplan, Haim; Shamir, Ron; Tarjan, Robert E. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 373 KB

Polynomial algorithms for the weighted p

✍ Maw-Shang Chang; Yi-Chang Liu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 475 KB