Polynomial‑time algorithms achieve foremost‑path realization; fastest and shortest non‑periodic cases are NP‑hard. An FPT method works when few entries have multiple values. Read more: https://getnews.me/temporal-graph-realization-for-fastest-shortest-and-foremost-paths/ #temporalgraph #algorithms

A new zero-shot method generates document‑wide temporal graphs in one step, and the paper was accepted to the main track of EMNLP 2025. Read more: https://getnews.me/zero-shot-global-temporal-graph-generation-boosts-nlp-event-understanding/ #zeroshot #temporalgraph #emnlp2025

3️⃣ Example usage:
Specify models via JSON:
```
# create a temporal graph
TG = TemporalGraph(
model_config_file="your_model_config.json",
input_shape=[C, H, W],
num_timesteps=your_unroll_time
)
# unroll using temporal graph
output = TG(input, # shape (bs, T, C, H, W)
n_times=your_unroll_time
)
```

📚 This week's reading group:
🗓 Thursday, May 1st | 🕚 11am EDT
🎙 Jason Schoeters (Univ. of Florence, DISIA Lab) presents:
Spanners in Temporal Graphs
🔗 Paper | www.sciencedirect.com/science/arti...
🪩zoom link on website.

#Graph #TemporalGraph