Some Parameterized Problems On Digraphs
Gregory Gutin, Anders Yeo · The Computer Journal · 2007
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problems and directed k-leaf problems. We also prove some new results on the topic. Most of these new results are on parameterizations of the backward paired comparison problem.