Feedback arc set - PDFSEARCH.IO - Document Search Engine

Feedback arc set
Results: 8

#	Item
1	IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 61, NO. 12, JUNE 15, Efficient Methods to Compute Optimal Tree Approximations of Directed Information Graphs Add to Reading List Source URL: coleman.ucsd.edu Language: English Statistical models Spanning tree Networks Graphical models Bayesian network Minimum spanning tree Line graph Algorithm Directed acyclic graph Pi Feedback arc set Book:Graph Theory
2	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 Language: English - Date: 2011-08-22 06:36:01
3	arXiv:0911.5094v1 [cs.DS] 26 NovFaster FAST (Feedback Arc Set in Tournaments) Uriel Feige Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-11-13 23:56:53
4	PDF Document Add to Reading List Source URL: fpt.wdfiles.com Language: English - 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
5	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 Add to Reading List Source URL: tom.thesnail.org Language: English - Date: 2015-05-04 03:09:24 NP-complete problems Topological sorting Directed graph Algorithm Feedback arc set Network theory Shortest path problem Graph theory Mathematics Theoretical computer science
6	Sunday, July 12. 5pm-8pm. Opening Registration and Reception. Lobby of the Niagara Falls Conference Center. Monday, July 13 8:00am--9:00am. (Room: Foyer) Breakfast at the Niagara Falls conference center. 9:00am--10:00am. Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2009-07-09 14:56:30 Directed acyclic graph Feedback arc set Edge coloring Chordal graph Matching Graph theory NP-complete problems Graph coloring
7	T HEORY OF C OMPUTING, Volume[removed]), pp. 179–195 http://theoryofcomputing.org Approximation Algorithms and Online Mechanisms for Item Pricing∗ Maria-Florina Balcan† Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2007-09-27 01:28:53 NP-complete problems Graph theory Approximation algorithm Hypergraph Time complexity Vertex cover Feedback arc set Theoretical computer science Computational complexity theory Applied mathematics
8	T HEORY OF C OMPUTING, Volume[removed]), pp. 179–195 http://theoryofcomputing.org Approximation Algorithms and Online Mechanisms for Item Pricing∗ Maria-Florina Balcan† Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2007-09-27 01:28:53 NP-complete problems Graph theory Approximation algorithm Hypergraph Time complexity Vertex cover Feedback arc set Theoretical computer science Computational complexity theory Applied mathematics

UPDATE