BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20261017T185324Z
UID:Seminar-ACS-1521@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Karteek Sreenivasaiah:MAILTO:Karteek.Sreenivasaiah@liverpool.ac.uk
DTSTART:20261021T130000
DTEND:20261021T140000
SUMMARY:Algorithms and Computing Systems Series
DESCRIPTION:Viktor Zamaraev: Recent Advances in Adjacency Labeling Schemes\n\nAdjacency labeling schemes provide a local representation of graphs: each vertex is assigned a short label, and adjacency between two vertices can be determined solely from their labels. In this talk, I will survey recent advances in adjacency labeling schemes, with a particular emphasis on small graph classes. I will highlight new positive results that establish efficient labeling schemes for broad families of such classes, as well as recent lower bounds that reveal fundamental limitations of these representations. The talk will outline several directions for future work.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1521
LOCATION:GH223
END:VEVENT
END:VCALENDAR