Feedback arc set in bipartite tournaments is NP-complete

Information Processing Letters

Volumn 102, Issue 2-3, 2007, Pages 62-65

  Guo, Jiong ^a   Hüffner, Falk ^a   Moser, Hannes ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Bipartite tournaments; Combinatorial problems; Computational complexity; Feedback set problems

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; FEEDBACK; GRAPH THEORY; PROBLEM SOLVING;

BIPARTITE TOURNAMENTS; COMBINATORIAL PROBLEMS; FEEDBACK SET PROBLEMS; GRAPH ACYCLIC;

DATA PROCESSING;

EID: 33847255862     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.11.016     Document Type: Article

References (12)

1. Ailon N., Charikar M., and Newman A. Aggregating inconsistent information: ranking and clustering. Proc. 37th STOC (2005), ACM Press 684-693
2. Alon N. Ranking tournaments. SIAM Journal on Discrete Mathematics 20 1 (2006) 137-142
3. Ausiello G., D'Atri A., and Protasi M. Structure preserving reductions among convex optimization problems. Journal of Computer and System Sciences 21 (1980) 136-153
4. Bang-Jensen J., and Thomassen C. A polynomial algorithm for the 2-path problem for semicomplete digraphs. SIAM Journal on Discrete Mathematics 5 3 (1992) 366-376
5. Cai M.-C., Deng X., and Zang W. A min-max theorem on feedback vertex sets. Mathematics of Operations Research 27 2 (2002) 361-371
6. Charbit P., Thomassé S., and Yeo A. The minimum feedback arc set problem is NP-hard for tournaments. Combinatorics, Probability and Computing 16 1 (2007) 1-4
7. Conitzer V. Computing Slater rankings using similarities among candidates. Proc. 21st AAAI (2006), AAAI Press
8. Dom M., Guo J., Hüffner F., Niedermeier R., and Truß A. Fixed-parameter tractability results for feedback set problems in tournaments. Proc. 6th CIAC. Lecture Notes in Computer Science vol. 3998 (2006), Springer, Berlin 320-331
9. G. Gutin, A. Yeo, Some parameterized problems on digraphs, The Computer Journal (special issue on parameterized complexity) (2006), submitted for publication
10. Shamir A. A linear time algorithm for finding cutsets in reduced graphs. SIAM Journal on Computing 8 4 (1979) 645-655
11. Speckenmeyer E. On feedback problems in digraphs. Proc. 15th WG. Lecture Notes in Computer Science vol. 411 (1989), Springer, Berlin 218-231
12. Wang C.-C., Lloyd E.L., and Soffa M.L. Feedback vertex sets and cyclically reducible graphs. Journal of the ACM 32 2 (1985) 296-313