Algorithms for temporal graphs

Atlantic Combinatorics Seminar

Jessica Enright, University of Glasgow

Temporal graphs are graphs in which the edges are only active at specified times – this allows us to model (for example) contact processes that change over time. I will discuss basics of temporal graphs, give some practical examples that inspired me to start working with them, and outline several examples of computational problems on temporal graphs.  I will briefly introduce the idea of parameterised algorithmics, and talk about some useful parameters on temporal graphs.  


Location: ED2018B

Date and Time: Wednesday, Sept. 23 at 04:10 PM - 05:10 PM (NDT)