BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: A temporal graph is a graph whose edge set changes over a sequ
 ence of discrete time steps. This can be viewed as a discrete sequence  G  
 1 \,  G  2 \, ... of static graphs\, each with a fixed vertex set  V . Rese
 arch in this area is motivated by the fact that many modern systems are hig
 hly dynamic and relations (edges) between objects (vertices) vary with time
 . Although static graphs have been extensively studied for decades from an 
 algorithmic point of view\, we are still far from having a concrete set of 
 structural and algorithmic principles for temporal graphs. Many notions and
  algorithms from the static case can be naturally transferred in a meaningf
 ul way to their temporal counterpart\, while in other cases new approaches 
 are needed to define the appropriate temporal notions. In particular\, some
  problems become radically different\, and often substantially more difficu
 lt\, when the time dimension is additionally taken into account. In this ta
 lk we will discuss some natural but only recently introduced temporal probl
 ems and some algorithmic approaches to them.   This lecture has been record
 ed. 
DTSTAMP:20220216T114900
DTSTART:20220131T141500
CLASS:PUBLIC
LOCATION:Online via Zoom.
SEQUENCE:0
SUMMARY:George Mertzios (Durham University\, UK): Algorithmic Problems on T
 emporal Graphs
UID:107920051@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20220131-L-Mer
 tzios.html
END:VEVENT
END:VCALENDAR