You are currently offline. Some features of the site may not work correctly.

# 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… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
• ISAAC
• 2010
• Corpus ID: 16512997
We study fixed parameter algorithms for three problems: Kemeny rank aggregation, feedback arc set tournament, and betweenness… Expand
Is this relevant?
2009
2009
We present an algorithm that finds a feedback arc set of size $k$ in a tournament in time $n^{O(1)}2^{O(\sqrt{k})}$. This is… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
• Comb. Probab. Comput.
• 2007
• Corpus ID: 36539840
Answering a question of Bang-Jensen and Thomassen [4], we prove that the minimum feedback arc set problem is NP-hard for… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Estrogen prevents osteoporotic bone loss by attenuating bone resorption; however, the molecular basis for this is unknown. Here… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
• IACR Cryptol. ePrint Arch.
• 2004
• Corpus ID: 14336721
We present a general technique for the efficient computation of pairings on Jacobians of supersingular curves. This formulation… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Various methods of automatic shot boundary detection have been proposed and claimed to perform reliably. Detection of edits is… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
• 1997
• Corpus ID: 55787878
In sharp contrast to molecules, electronic states of clusters with an excited intermediate-shell electron can efficiently decay… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
When Andrew John Wiles was 10 years old, he read Eric Temple Bell’s The Last Problem and was so impressed by it that he decided… Expand
Is this relevant?
1995
1995
• G. Isaak
• Electron. J. Comb.
• 1995
• Corpus ID: 41822539
We examine the size s(n) of a smallest tournament having the arcs of an acyclic tournament on n vertices as a minimum feedback… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
• Inf. Process. Lett.
• 1993
• Corpus ID: 30785719
Let G=(V, A) denote a simple connected directed graph, and let n=|V|, m=|A|, where nt-1≤m≤(n2) A feedbackarc set (FAS) of G… Expand
Is this relevant?