Dominating set - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2012-09-17 05:11:28 NP-complete problems Vertex cover Approximation algorithm Cubic graph Feedback arc set Dominating set Graph theory Theoretical computer science Mathematics		Add to Reading List Source URL: fpt.wdfiles.com Download Document from Source Website File Size: 226,79 KB Share Document on Facebook

	IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 61, NO. 12, JUNE 15, Efficient Methods to Compute Optimal Tree Approximations of Directed Information Graphs DocID: 1oWzg - View Document
	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 DocID: 1ojm3 - View Document
	arXiv:0911.5094v1 [cs.DS] 26 NovFaster FAST (Feedback Arc Set in Tournaments) Uriel Feige DocID: 1dCCl - View Document
	PDF Document DocID: 16rBh - View Document
	Ranking Tournaments: Local Search and a New Algorithm TOM COLEMAN and ANTHONY WIRTH The University of Melbourne Ranking is a fundamental activity for organising and, later, understanding data. Advice of the DocID: 15I16 - View Document