Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

CJ
2008

favoriteEmaildiscussreport

69views more CJ 2008»

Some Parameterized Problems On Digraphs

13 years 4 months ago

Some Parameterized Problems On Digraphs

Download www.cs.rhul.ac.uk

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

Real-time Traffic

CJ 2008 | Open Questions | Parameterized Problems | Problems |

claim paper

Related Content

» Better Algorithms and Bounds for Directed Maximum Leaf Problems

» Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems

» Parameterized complexity of the induced subgraph problem in directed graphs

» On the directed Full Degree Spanning Tree problem

» Minimum Leaf OutBranching Problems

» Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes

» The Parameterized Complexity of Some Minimum Label Problems

» On the Complexity of Some Colorful Problems Parameterized by Treewidth

» The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CJ
Authors	Gregory Gutin, Anders Yeo

Comments (0)