BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260922T121957Z
UID:Seminar-dept-1252@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20250325T130000
DTEND:20250325T140000
SUMMARY:School Seminar Series
DESCRIPTION:Thomas Erlebach: Temporal Graph Realization Problems\n\nTemporal graphs are graphs that have a fixed vertex set but whose edge set can change in every time step. They can model time-varying or dynamic networks arising in many application areas such as public transport networks, social networks, and mobile or reconfigurable communication networks. A temporal graph can be represented as a graph G=(V,E) together with a labelling function that maps each edge to the set of time steps during which it is present. An edge e present at time t is referred to as a time edge. A temporal path from u to v is then a sequence of time edges that form a path from u to v and have increasing time labels. Temporal graph realization refers to problems of the following kind: Given some requirements about the temporal paths that we would like to have between the vertices of the graph, does there exist a temporal graph that meets these requirements? In this talk, we will discuss results for such temporal graph realization problems where the requirements specify the fastest travel durations (arrival time minus departure time of a temporal path) for all pairs of vertices or specify for each pair (u,v) of vertices whether there should be a temporal path from u to v or not.\n\n\n\nThe talk is based on a SAND 2024 paper with Nils Morawietz and Petra Wolf, and on unpublished work with Othon Michail and Nils Morawietz.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1252
LOCATION:ELEC204, 2th Floor Lecture Theater EEE
END:VEVENT
END:VCALENDAR