Indexed metadata
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
PIERRE CHARBIT, STÉPHAN THOMASSÉ, ANDERS YEO
Source record
Source: Crossref
Published: Sep 20, 2006
DOI: 10.1017/s0963548306007887
Open original source ↗Source abstract
Answering a question of Bang-Jensen and Thomassen [4], we prove that the minimum feedback arc set problem is NP-hard for tournaments.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.