Skip to search formSkip to main contentSkip to account menu

Feedback vertex set

Known as: Cycle Cutset, Feedback (disambiguation) 
In the mathematical discipline of graph theory, a feedback vertex set of a graph is a set of vertices whose removal leaves a graph without cycles. In… 
Wikipedia (opens in a new tab)

Related topics

Related topics

29 relations
APXAlgorithmicaArtificial IntelligenceBidimensionality

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
On Feedback Vertex Set New Measure and New Structures
We study the parameterized complexity of the feedback vertex set problem (fvs) on undirected graphs. We approach the problem by… 
2009
2009
Feedback reduction scheme for downlink multiuser diversity
A group random access-based feedback scheme is proposed for multiuser diversity systems, where users are divided into several… 
2008
2008
Undirected Feedback Vertex Set
  • Jiong Guo
  • Encyclopedia of Algorithms
  • 2008
  • Corpus ID: 6935751
Karp [11] showed that UFVS is NP-complete. Lund and Yannakakis [12] proved that there exists some constant > 0 such that it is NP… 
2008
2008
Capacity and Fairness in Multiuser Diversity Systems with Opportunistic Feedback
An opportunistic feedback protocol is proposed for multiuser diversity systems with proportional fair scheduling and maximum… 
2007
2007
Directed Feedback Vertex Set Problem is FPT
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long standing open… 
2007
2007
Directed Feedback Vertex Set is Fixed-Parameter Tractable
We resolve positively a long standing open question regarding the fixed-parameter tractability of the parameterized Directed… 
1997
1997
On the feedback vertex set problem for a planar graph
An algorithm solving the feedback-vertex-set problem for planar digraphs is described. In particular, planar graphs with a… 
1996
1996
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satisfiability and constraint… 
1994
1994
Synthesizing designs with low-cardinality minimum feedback vertex set for partial scan application
An efficient partial scan approach for cost-effective sequential ATPG is to select flip-flops (FFs) in the minimum feedback… 
1992
1992
Finding All Solutions if You can Find One
Author(s): Dechter, Rina; Itai, Alon | Abstract: We address the problem of enumerating (producing) all models of a given theory… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)