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 条
  • [11] Freedback arc set problem in bipartite tournaments
    Gupta, Sushmita
    Theory and Applications of Models of Computation, Proceedings, 2007, 4484 : 354 - 361
  • [12] Kernels for feedback arc set in tournaments
    Bessy, Stephane
    Fomin, Fedor V.
    Gaspers, Serge
    Paul, Christophe
    Perez, Anthony
    Saurabh, Saket
    Thomasse, Stephan
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2011, 77 (06) : 1071 - 1078
  • [13] COMPLEMENTARY CYCLES CONTAINING A FIXED ARC AND A FIXED VERTEX IN BIPARTITE TOURNAMENTS
    ZHANG, KM
    WANG, JZ
    ARS COMBINATORIA, 1993, 35 : 265 - 269
  • [14] 2-Approximating Feedback Vertex Set in Tournaments
    Lokshtanov, Daniel
    Misra, Pranabendu
    Mukherjee, Joydeep
    Panolan, Fahad
    Philip, Geevarghese
    Saurabh, Saket
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1010 - 1018
  • [15] 2-Approximating Feedback Vertex Set in Tournaments
    Lokshtanov, Daniel
    Misra, Pranabendu
    Mukherjee, Joydeep
    Panolan, Fahad
    Philip, Geevarghese
    Saurabh, Saket
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1010 - 1018
  • [16] A parameterized algorithm for subset feedback vertex set in tournaments
    Bai, Tian
    Xiao, Mingyu
    THEORETICAL COMPUTER SCIENCE, 2023, 975
  • [17] 2-Approximating Feedback Vertex Set in Tournaments
    Lokshtanov, Daniel
    Misra, Pranabendu
    Mukherjee, Joydeep
    Panolan, Fahad
    Philip, Geevarghese
    Saurabh, Saket
    ACM TRANSACTIONS ON ALGORITHMS, 2021, 17 (02)
  • [18] A cubic kernel for Feedback Vertex Set
    Bodlaender, Hans L.
    Stacs 2007, Proceedings, 2007, 4393 : 320 - 331
  • [19] Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments
    Kumar, Mithilesh
    Lokshtanov, Daniel
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [20] Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
    Agrawal, Akanksha
    Lokshtanov, Daniel
    Misra, Pranabendu
    Saurabh, Saket
    Zehavi, Meirav
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 1383 - 1398
12345