BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20251026T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20250603T104500
DTEND;TZID=Europe/Paris:20250603T114500
DTSTAMP:20260419T092729
CREATED:20250416T144229Z
LAST-MODIFIED:20250526T134922Z
UID:11834-1748947500-1748951100@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Graphs of Shortest Paths »\, Mehdi Naima (LIP6\, Sorbonne Univ.)
DESCRIPTION:In this talk\, we will explore graphs of shortest paths—directed acyclic graphs (DAGs) derived from shortest path traversals of a graph rooted at a fixed source. After establishing a precise definition of these structures\, we will examine methods for uniformly sampling them and investigate their typical shape. Along the way\, we will uncover interesting connections to bipartite graphs.
URL:https://www.greyc.fr/event/seminaire-algorithmique-mehdi-naima-lip6-sorbonne-univ/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR