A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments
The k-feedback arc set problem is to determine whether there is a set F of at most k arcs in a directed graph G such that the removal of F makes G acyclic. The k-feedback arc set problems in tournaments and bipartite tournaments (k-FAST and k-FASBT) have applications in ranking aggregation and have been extensively studied from the viewpoint of parameterized complexity. Recently, Misra et al. provide a problem kernel with O(k 3) vertices for k-FASBT. Answering an open question by Misra et al., we improve the kernel bound to O(k 2) vertices by introducing a new concept called “bimodule.”
KeywordsKernelization Feedback arc set Bipartite tournament Graph algorithms Parameterized algorithms
Unable to display preview. Download preview PDF.
- 11.Kemeny, J.: Mathematics without numbers. Daedalus 88, 571–591 (1959)Google Scholar
- 12.Kemeny, J., Snell, J.: Mathematical models in the social sciences. Blaisdell (1962)Google Scholar
- 18.Wahlström, M.: Algorithms, Measures and Upper Bounds for Satisfiability and Related Problems. PhD thesis, Linköpings universitet (2007)Google Scholar