Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:alsoKnownAs |
cycle edge set
|
| gptkbp:appliesTo |
directed graphs
undirected graphs |
| gptkbp:complexity |
NP-complete
|
| gptkbp:defines |
A set of edges whose removal makes a graph acyclic
|
| gptkbp:hasApplication |
software engineering
bioinformatics network analysis |
| https://www.w3.org/2000/01/rdf-schema#label |
Feedback Edge Set
|
| gptkbp:minimumFeedbackEdgeSet |
smallest set of edges whose removal makes the graph acyclic
|
| gptkbp:relatedTo |
gptkb:Feedback_Vertex_Set
graph cycle |
| gptkbp:solvedBy |
approximation algorithms
exact algorithms |
| gptkbp:studiedBy |
graph theorists
|
| gptkbp:type |
combinatorial optimization
|
| gptkbp:usedIn |
circuit design
constraint satisfaction deadlock resolution |
| gptkbp:bfsParent |
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972)
|
| gptkbp:bfsLayer |
6
|