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 - Feedback arc set - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2011-08-22 06:36:01 Open Document File Size: 129,19 KB Share Result on Facebook

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 feedbaAdd to Reading List