Parameterized Complexity of Induced H-Matching on Claw-Free Graphs

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen. Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. In Leah Epstein, Paolo Ferragina, editors, Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Volume 7501 of Lecture Notes in Computer Science, pages 624-635, Springer, 2012. [doi]

Abstract

Abstract is missing.