A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments

被引：2
|
作者：
Xiao, Mingyu [1 ]
Guo, Jiong [2 ]
机构：
[1] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu 610054, Peoples R China
[2] Univ Saarland, D-66123 Saarbrucken, Germany
来源：
ALGORITHMICA | 2015年 / 71卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Kernelization; Feedback arc set; Bipartite tournament; Graph algorithms; Parameterized algorithms;
D O I：
10.1007/s00453-013-9783-2
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：87 / 97
页数：11
相关论文
共 50 条
12345