Some Parameterized Problems On Digraphs

Authors:
Gregory Gutin;Anders Yeo
Affiliations:
-;-
Venue:
The Computer Journal
Year:
2008

Citing 0
Cited 10

Feedback arc set in bipartite tournaments is NP-complete

Information Processing Letters
A fixed-parameter algorithm for the directed feedback vertex set problem

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A fixed-parameter algorithm for the directed feedback vertex set problem

Journal of the ACM (JACM)
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On Making Directed Graphs Transitive

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Parameterized complexity of candidate control in elections and related digraph problems

Theoretical Computer Science
Fixed-parameter tractability results for feedback set problems in tournaments

Journal of Discrete Algorithms
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree

ACM Transactions on Algorithms (TALG)
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables

Journal of Computer and System Sciences
Parameterized algorithms for directed maximum leaf problems

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.