Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-27T05:34:29.816Z Has data issue: false hasContentIssue false
  • English
  • Français

The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments

Published online by Cambridge University Press:  20 September 2006

PIERRE CHARBIT ,
STÉPHAN THOMASSÉ  and
ANDERS YEO
PIERRE CHARBIT
Affiliation:
Laboratoire Camille Jordan, Université Claude Bernard, Lyon 1, France (e-mail: charbit@univ-lyon1.fr, thomasse@univ-lyon1.fr)
STÉPHAN THOMASSÉ
Affiliation:
Laboratoire Camille Jordan, Université Claude Bernard, Lyon 1, France (e-mail: charbit@univ-lyon1.fr, thomasse@univ-lyon1.fr)
ANDERS YEO
Affiliation:
Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK (e-mail: anders@cs.rhul.ac.uk)
Get access Rights & Permissions [Opens in a new window]

Abstract

Answering a question of Bang-Jensen and Thomassen [4], we prove that the minimum feedback arc set problem is NP-hard for tournaments.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 16 , Issue 1 , January 2007 , pp. 1 - 4
Copyright
© 2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)