Sciweavers

Share
CJ
2008

Some Parameterized Problems On Digraphs

8 years 10 months ago
Some Parameterized Problems On Digraphs
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.
Gregory Gutin, Anders Yeo
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CJ
Authors Gregory Gutin, Anders Yeo
Comments (0)
books