✦ LIBER ✦

On the parameterized vertex cover problem for graphs with perfect matching

✍ Scribed by Wang, JianXin; Li, WenJun; Li, ShaoHua; Chen, JianEr

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized reductions and algorithms

✍ Peter Damaschke; Leonid Molokov 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 224 KB

A graph approximation heuristic for the

✍ D.L. Meek; R. Gary Parker 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 684 KB

Perfect matching for regular graphs is A

✍ Elias Dahlhaus; Marek Karpinski 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 491 KB

Improved Approximation Algorithms for th

✍ Halperin, Eran 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 198 KB

On the index of tricyclic graphs with pe

✍ Xianya Geng; Shuchao Li; Xuechao Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 524 KB

An NC Algorithm for the Perfect Matching

✍ J. Lakhal; L. Litzler 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 34 KB