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 条
  • [41] Improved FPT algorithm for feedback vertex set problem in bipartite tournament
    Sasatte, Prashant
    INFORMATION PROCESSING LETTERS, 2008, 105 (03) : 79 - 82
  • [42] Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
    Fomin, Fedor V.
    Lokshtanov, Daniel
    Raman, Venkatesh
    Saurabh, Saket
    PROCEEDINGS OF THE TWENTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-10), 2010, : 65 - 70
  • [43] A classification of tournaments having an acyclic tournament as a minimum feedback arc set
    Isaak, G
    Narayan, DA
    INFORMATION PROCESSING LETTERS, 2004, 92 (03) : 107 - 111
  • [44] The minimum feedback arc set problem is NP-hard for tournaments
    Charbit, Pierre
    Thomasse, Stephan
    Yeo, Anders
    COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (01): : 1 - 4
  • [45] Vertex disjoint 4-cycles in bipartite tournaments
    Balbuena, C.
    Gonzalez-Moreno, D.
    Olsen, M.
    DISCRETE MATHEMATICS, 2018, 341 (04) : 1103 - 1108
  • [46] A 4k2 Kernel for Feedback Vertex Set
    Thomasse, Stephan
    ACM TRANSACTIONS ON ALGORITHMS, 2010, 6 (02)
  • [47] Restricted arc-connectivity of bipartite tournaments
    Grueter, Steffen
    Guo, Yubao
    Holtkamp, Andreas
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (13-14) : 2008 - 2013
  • [48] Quadratic vertex kernel for split vertex deletion
    Agrawal, Akanksha
    Gupta, Sushmita
    Jain, Pallavi
    Krithika, R.
    THEORETICAL COMPUTER SCIENCE, 2020, 833 : 164 - 172
  • [49] Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
    Gupta, Sushmita
    Modak, Sounak
    Saurabh, Saket
    Seetharaman, Sanjay
    LATIN 2024: THEORETICAL INFORMATICS, PT I, 2024, 14578 : 225 - 240
  • [50] Critical Kernel Imperfect Problem in Generalizations of Bipartite Tournaments
    Ruixia Wang
    Graphs and Combinatorics, 2019, 35 : 669 - 675
12345