论文信息 - Feedback arc set in bipartite tournaments is NP-complete

Feedback arc set in bipartite tournaments is NP-complete

The Feedback Arc Set problem asks whether it is possible to delete at most k arcs to make a directed graph acyclic. We show that Feedback Arc Set is NP-complete for bipartite tournaments, that is, directed graphs that are orientations of complete bipartite graphs.

Hannes Moser | Falk Hüffner | Jiong Guo

[1] Gregory Gutin,et al. Some Parameterized Problems On Digraphs , 2008, Comput. J..

[2] Rolf Niedermeier,et al. Fixed-parameter tractability results for feedback set problems in tournaments , 2006, J. Discrete Algorithms.

[3] Giorgio Ausiello,et al. Structure Preserving Reductions among Convex Optimization Problems , 1980, J. Comput. Syst. Sci..

[4] Ewald Speckenmeyer,et al. On Feedback Problems in Diagraphs , 1989, WG.

[5] Mary Lou Soffa,et al. Feedback vertex sets and cyclically reducible graphs , 1985, JACM.

[6] Carsten Thomassen,et al. A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs , 1992, SIAM J. Discret. Math..

[7] Noga Alon,et al. Ranking Tournaments , 2006, SIAM J. Discret. Math..

[8] Vincent Conitzer,et al. Computing Slater Rankings Using Similarities among Candidates , 2006, AAAI.

[9] Xiaotie Deng,et al. A Min-Max Theorem on Feedback Vertex Sets , 1999, Math. Oper. Res..

[10] Anders Yeo,et al. The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments , 2006, Combinatorics, Probability and Computing.

[11] Adi Shamir,et al. A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs , 1979, SIAM J. Comput..