1 Hit in 7.7 sec

Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width [article]

Weidong Luo
In this paper we investigate the parameterized complexity for NP-hard graph problems parameterized by a structural parameter modular-width.  ...  We develop a recipe that is able to simplify the process of obtaining polynomial Turing compressions for a class of graph problems parameterized by modular-width.  ...  Szeider, editors, Parameterized and Exact Computation - 8th In- ternational Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Re- vised Selected Papers, volume 8246 of Lecture  ... 
doi:10.48550/arxiv.2201.04678 fatcat:y7e63hya5bg5bbv5z2kb2iftxe