Journal Article

The minimum feedback arc set problem is NP-hard for tournaments

Combinatorics Probability and Computing (2007) 16(1) 1-4
DOI: 10.1017/S0963548306007887
127Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Charbit, P., Thomassé, S., & Yeo, A. (2007). The minimum feedback arc set problem is NP-hard for tournaments. Combinatorics Probability and Computing, 16(1), 1–4. https://doi.org/10.1017/S0963548306007887

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free