The minimum feedback arc set problem is NP-hard for tournaments Pierre Charbit∗, St´ephan Thomass´e†and Anders Yeo‡ Abstract Answering a question of Bang-Jensen and Thomassen [4], we prove that the minimum feedba

First Page		Document Content
Date: 2011-08-22 06:36:01		The minimum feedback arc set problem is NP-hard for tournaments Pierre Charbit∗, St´ephan Thomass´e†and Anders Yeo‡ Abstract Answering a question of Bang-Jensen and Thomassen [4], we prove that the minimum feedba Add to Reading List Source URL: perso.ens-lyon.fr Download Document from Source Website File Size: 129,19 KB Share Document on Facebook