Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,608,993 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
29 relations
APX
Algorithmica
Artificial Intelligence
Bidimensionality
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Library. Engineering design. Help & Feedback.
Brendan Sinnamon
,
Graham C. Dawson
2014
Corpus ID: 228456241
Start looking for resources in mechanical design, electronic design, safety factor in engineering, computer aided design, etc…
Expand
2013
2013
Ondersteuning in Game-Gebaseerd Leren: De Invloed van Testen en Feedback op Leren met Games
Cansu Kiser
2013
Corpus ID: 141309665
The primary aim of this study is obtaining insight whether testing (with or without feedback) can provide support to game-based…
Expand
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…
Expand
2007
2007
Directed Feedback Vertex Set is Fixed-Parameter Tractable
Igor Razgon
,
B. O’Sullivan
Structure Theory and FPT Algorithmics for Graphs…
2007
Corpus ID: 15233206
We resolve positively a long standing open question regarding the fixed-parameter tractability of the parameterized Directed…
Expand
2007
2007
Directed Feedback Vertex Set Problem is FPT
Jianer Chen
,
Yang Liu
,
Songjian Lu
Structure Theory and FPT Algorithmics for Graphs…
2007
Corpus ID: 7156904
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long standing open…
Expand
Review
1999
Review
1999
A note on CSP graph parameters
T. Schiex
1999
Corpus ID: 18673243
Several graph parameters such as induced width, minimum maximum clique size of a chordal completion, k-tree number, bandwidth…
Expand
1999
1999
On odd primitive graphs
Fuyi Wei
,
Maoquan Chu
,
Jianzhong Wang
The Australasian Journal of Combinatorics
1999
Corpus ID: 276298
In this paper, we prove that every odd primitive graph must contain two vertex disjoint odd cycles. We also characterize a family…
Expand
1996
1996
A Pseudo ∈-Approximate Algorithm For Feedback Vertex Set
Tianbing Qian
,
Y. Ye
,
P. Pardalos
1996
Corpus ID: 1312091
While the picture of approximation complexity class becomes clear for most combinatorial optimization problems, it remains an…
Expand
1988
1988
Constraint processing incorporating, back jumping, learning, and cutset-decomposition
R. Dechter
[] Proceedings. The Fourth Conference on…
1988
Corpus ID: 60735026
Researchers in the areas of constraint-satisfaction problems (CSPs), logic programming, and truth-maintenance systems have…
Expand
1981
1981
Cycle Polynomials
F. Hwang
1981
Corpus ID: 11217419
Let G be a graph consisting of m vertex-disjoint cycles with possibly different numbers of vertices on each cycle. We want to…
Expand