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:20250506T104500
DTEND;TZID=Europe/Paris:20250506T114500
DTSTAMP:20260413T052835
CREATED:20250416T143918Z
LAST-MODIFIED:20250502T080848Z
UID:11828-1746528300-1746531900@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Enumeration of some families of chordal graphs »\, Jordi Castellvi (Univ. Barcelone\, Espagne)
DESCRIPTION:A graph is chordal if it has no induced cycle of length greater than 3. Alternatively\, Dirac proved that a graph is chordal if and only if every minimal separator is a clique. From this characterization it is not hard to prove that a k-connected chordal graph can be uniquely decomposed into (k+1)-connected components by cutting through all of its k-separators. One can then use the symbolic method to obtain recursive equations for the enumeration of some classes of chordal graphs. For instance\, chordal maps and (labeled) chordal planar graphs can be studied starting with their 3-connected components and the proceeding to the 2-connected and connected levels. The asymptotic growth of the family can be then deduced from the equations. We also count (labeled) chordal graphs with bounded tree-width by introducing variables that keep track of the number of cliques of every size. Finally\, we extend Pólya theory and the method of cycle pointing to enumerate unlabelled chordal graphs with bounded tree-width\, and the same technique works for unlabelled chordal planar graphs.
URL:https://www.greyc.fr/event/seminaire-algorithmique-jordi-castellvi-univ-barcelone-espagne/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR