CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 20459-20576
Annnotations
CORD-19_Custom_license_subset
| Id | Subject | Object | Predicate | Lexical cue |
|---|---|---|---|---|
| T154 | 0-117 | Sentence | denotes | The Set Cover problem is equivalent to deciding if there is a set S of k nodes in this bipartite graph with D(S) ≤ 1. |
CORD-19-Sentences
| Id | Subject | Object | Predicate | Lexical cue |
|---|---|---|---|---|
| TextSentencer_T154 | 0-117 | Sentence | denotes | The Set Cover problem is equivalent to deciding if there is a set S of k nodes in this bipartite graph with D(S) ≤ 1. |
| TextSentencer_T154 | 0-117 | Sentence | denotes | The Set Cover problem is equivalent to deciding if there is a set S of k nodes in this bipartite graph with D(S) ≤ 1. |
| T79217 | 0-117 | Sentence | denotes | The Set Cover problem is equivalent to deciding if there is a set S of k nodes in this bipartite graph with D(S) ≤ 1. |
Epistemic_Statements
| Id | Subject | Object | Predicate | Lexical cue |
|---|---|---|---|---|
| T62 | 0-117 | Epistemic_statement | denotes | The Set Cover problem is equivalent to deciding if there is a set S of k nodes in this bipartite graph with D(S) ≤ 1. |