Directed Feedback Vertex Set
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:application |
circuit design
program analysis deadlock resolution |
| gptkbp:complexity |
fixed-parameter tractable
|
| gptkbp:definedIn |
graph
|
| gptkbp:describes |
A set of vertices whose removal makes a directed graph acyclic.
|
| gptkbp:estimatedCost |
yes
|
| gptkbp:field |
theoretical computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Directed Feedback Vertex Set
|
| gptkbp:optimizationProblem |
minimum number of vertices to remove to break all cycles
|
| gptkbp:relatedTo |
gptkb:Feedback_Vertex_Set
gptkb:Directed_Acyclic_Graph |
| gptkbp:type |
gptkb:NP-hard
|
| gptkbp:bfsParent |
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972)
|
| gptkbp:bfsLayer |
6
|