Abstract

We survey known results on parameterized complexity of the feedback set and induced subdigraph problems for digraphs. We prove new results on some parameterizations of the paired comparison problems on digraphs. One of our theorems implies a new result for a parameterized version of the linear arrangement problem for undirected graphs. We state several open problems. 1

Citations