FOLTY is the first algorithm for thresholded FOL triadic motif queries on temporal networks, with O(m α log σ_max) running time matching the best temporal triangle counters.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Triadic First-Order Logic Queries in Temporal Networks
FOLTY is the first algorithm for thresholded FOL triadic motif queries on temporal networks, with O(m α log σ_max) running time matching the best temporal triangle counters.