<aside>

============== Under Construction ==============

</aside>

Disclaimer: All to the best of our knowledge.

History of Temporal Graphs

Networks that change over time have been studied by different disciplines with diverse motivations. The following is a list of early research that is related to the present-day concept of temporal graphs (not considering the flow over time discussed by Ford and Fulkerson in 1962):

• 1966 Cooke and Halsey analysed shortest temporal trips where the travel times on every edge change over (discrete) time steps, are directed and can be set to $\infty$ to signify that this edge is not present at a certain time step.
• 1972-1991 Baker and Shostak; Hajnal, Milner and Szemerédi; Bumby; Awerbuch and Even; Hedetniemi, Hedetniemi and Liestman; Göbel, Cerdeira and Veldman; … researched Gossip Theory and broadcasting
  • What is the number of edges needed to realize a temporally connected graph (every vertex can reach every other vertex)
  • flooding/exploring a graph with information via phone calls
• 1974 Halpern and Priess directed, travel time, edges close, “parking” (waiting at a node) occupies station, trains can still travel through but not “park”
  • temporal dijkstra - @Michelle Döring check
  • time-expanded network — define static expansion
• 1996 Berman discussed flows and computing paths in (un)directed (non)strict edge-scheduled networks
• 1997 Haray and Gupta defined the graph models: node- and edge-dynamic graphs

A lot happened in 2002

• 2002 Kempe, Kleinberg and Kumar first used the name of temporal networks
• 2002 Xuan, Ferreira and Jarry computed optimal temporal trips
• …. @Michelle Döring finish

<aside>

The following is a database on the different names of the concept of “temporal graphs”. It also contains the (to our knowledge) first usage or mentioning of that name.

if you believe one of those Who’s or When’s to be incorrect, let us know via [email protected]

</aside>

Names