CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 31010-31171 JSONTXT

Annnotations TAB JSON ListView MergeView

    CORD-19_Custom_license_subset

    When the shortest path from u to S in graph G = (V, E, m) is unique, the quantity d(u, S) ∧ T max can be used to approximate the detection time E[ (u, S)], i.e.,

    CORD-19-Sentences

    When the shortest path from u to S in graph G = (V, E, m) is unique, the quantity d(u, S) ∧ T max can be used to approximate the detection time E[ (u, S)], i.e.,

    Epistemic_Statements

    When the shortest path from u to S in graph G = (V, E, m) is unique, the quantity d(u, S) ∧ T max can be used to approximate the detection time E[ (u, S)], i.e.,