Feedback arc set

Known as: Feedback edge set, Fas, Feedback (disambiguation) 
In graph theory, a directed graph may contain directed cycles, a one-way loop of edges. In some applications, such cycles are undesirable, and we… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The minimum feedback arc set problem is an NP-hard problem on graphs that seeks a minimum set of arcs which, when removed from… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
Article history: Received 10 January 2012 Received in revised form 22 September 2012 Accepted 24 January 2013 Available online 29… (More)
Is this relevant?
2011
2011
The feedback arc set problem plays a prominent role in the four-phase framework to draw directed graphs, also known as the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
We present an algorithm that finds a feedback arc set of size k in a tournament in time n2 √ . This is asymptotically faster than… (More)
Is this relevant?
2007
2007
In this paper we give ratio 4 deterministic and randomized approximation algorithms for the FEEDBACK ARC SET problem in bipartite… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Answering a question of Bang-Jensen and Thomassen [4], we prove that the minimum feedback arc set problem is NP-hard for… (More)
Is this relevant?
2007
2007
The Feedback Arc Set problem asks whether it is possible to delete at most k arcs to make a directed graph acyclic. We show that… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1995
1995
Since the FAS problem is NP-hard it that we can this problem in time. A number of heuristics have been published. Some achieve… (More)
  • figure 1
  • figure 2
  • figure 6
Is this relevant?
1993
1993
Let G V A denote a simple connected directed graph and let n jV j m jAj where n m n A feedback arc set FAS of G denoted R G is a… (More)
Is this relevant?
1988
1988
We present a polynomial-time algorithm for fmding a minimum weight feedback arc set (FAS) in arc-weighted reducible flow graphs… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?