Temporal Graph Realization for Fastest, Shortest, and Foremost Paths

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: getnews.me/temporal-graph-realizati... #temporalgraph #algorithms

Zero-shot Global Temporal Graph Generation Boosts NLP Event Understanding

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: getnews.me/zero-shot-global-tempora... #zeroshot #temporalgraph #emnlp2025

📚 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