CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 31179-31272 2 Projects
Annnotations
| Id | Subject | Object | Predicate | Lexical cue |
|---|---|---|---|---|
| TextSentencer_T260 | 0-93 | Sentence | denotes | In fact, when the shortest path from u to S in graph G = (V, E, m) is unique, it follows that |
| TextSentencer_T260 | 0-93 | Sentence | denotes | In fact, when the shortest path from u to S in graph G = (V, E, m) is unique, it follows that |
| T72303 | 0-93 | Sentence | denotes | In fact, when the shortest path from u to S in graph G = (V, E, m) is unique, it follows that |