科研之友
微信
新浪微博
Facebook
分享链接
摘要
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. By introducing a new concept called "bimodule", we provide a problem kernel with O(k (2)) vertices for k-FASBT, which improves the previous result by a factor of k.
- 出版日期2015-1
- 单位电子科技大学
