Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs

Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh. Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. In Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk, editors, Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers. Volume 8165 of Lecture Notes in Computer Science, pages 370-381, Springer, 2013. [doi]

Abstract

Abstract is missing.