1 paper · 1 filter
Sheikh Shakil Akhtar, Pranabendu Misra, Geevarghese Philip
We study "space efficient" FPT algorithms for graph problems with limited memory. Let n be the size of the input graph and k be the parameter. We present algorithms that run in tim…