BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1165
DTSTAMP:20230914T125953Z
SUMMARY:The Space Complexity of Sum Labelling
DESCRIPTION:Speaker: Kshitij Gajjar (National University of Singapore)\n\nA
bstract: \nHow does one store a graph in the database? Typically the verti
ces are labelled by a set {1\, 2\, ...\, n}. The edges can be denoted in m
any different ways: adjacency matrix\, incidence matrix\, adjacency list\,
to name a few. But what if the vertices are labelled in a more creative w
ay\, such that the labels of the vertices themselves denote their adjacenc
ies? This eliminates the need for storing the edges! This topic is part of
a heavily researched field called graph labelling\, with connections to c
oding theory and information theory. In this talk\, we will explore a type
of graph labelling known as sum labelling. This is joint work with Hennin
g Fernau (https://eccc.weizmann.ac.il/report/2021/114).\n\nZoom Link: http
s://zoom.us/j/93889521556pwd=eEFJWVRtRHNpNlpZWmhNYTJGQTF6Zz09\n
URL:https://www.tcs.tifr.res.in/web/events/1165
DTSTART;TZID=Asia/Kolkata:20211001T171500
DTEND;TZID=Asia/Kolkata:20211001T181500
END:VEVENT
END:VCALENDAR