BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:fa02596b-56d8-4d8c-8090-c8a4ed903d53
X-WR-CALNAME:[gt.go] - 'Exploration of Temporal graphs' by Paul Bastide
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20271031T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20251026T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20261025T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20250330T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20260329T020000
RDATE:20270328T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:fa02596b-56d8-4d8c-8090-c8a4ed903d53
DTSTAMP:20260517T063308Z
CLASS:PUBLIC
DESCRIPTION:A temporal graph G is a sequence of graphs G1\, G2\, ... \, Gt 
 on the same vertex set. In this talk\, we are interested in the analogue o
 f the Travelling Salesman Problem for temporal graphs. It is referred to i
 n the literature as the Temporal Exploration Problem\, and asks for the mi
 nimum length of an exploration of the graph\, that is\, a sequence of vert
 ices such that at each time step t\, one either stays at the same vertex o
 r moves along a single edge of Gt. \n\nOne natural and still open case is 
 when each graph Gt is connected and has bounded maximum degree. We present
  a short proof that any such graph admits an exploration in O(n^(3/2) log 
 n^(1/2)) time steps. In fact\, we deduce this result from a more general s
 tatement by introducing the notion of average temporal maximum degree. Thi
 s more general statement improves the previous best bounds\, under a unifi
 ed approach\, for several studied exploration problems. \n\nThis is based 
 on joint work with Carla Groenland\, Lukas Michel and Clément Rambaud. \n
 \n(Paul Bastide) [University of Oxford] \n\n\nVérifiez que vous êtes bien 
 inscrits sur le site du [gdr-ifm-gt-graphes] : [ https://gtgraphes.labri.f
 r/pmwiki/pmwiki.php/Equipes/Equipes#membres | https://gtgraphes.labri.fr/p
 mwiki/pmwiki.php/Equipes/Equipes#membres ] \n\nRemarks / Remarques \n\nFin
 d all the information of the working group on this [ https://graphesetopti
 misation.labri.fr/pmwiki.php/Groupe/GT?userlang=en | web page ] . \nRetrou
 vez toutes les informations du GT sur cette [ https://graphesetoptimisatio
 n.labri.fr/pmwiki.php/Groupe/GT | page web ] . \n\n\n\nImport automatique 
 depuis https://webmel.u-bordeaux.fr/home/bf-labri.ca@u-bordeaux.fr/gt.go.i
 cs par sync_icals_to_drupal.py pour GT-GO
DTSTART;TZID=Europe/Paris:20260320T143000
DTEND;TZID=Europe/Paris:20260320T150000
LOCATION:LaBRI/178
SEQUENCE:0
SUMMARY:[gt.go] - 'Exploration of Temporal graphs' by Paul Bastide
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
