BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/569
DTSTAMP:20230914T125929Z
SUMMARY:Distance Preserving Minors in Graphs
DESCRIPTION:Speaker: Kshitij Gajjar\n\nAbstract: \nAbstract: We consider u
ndirected\, connected graphs with nonnegative weights on the edges. Additi
onally\, a special subset of vertices called terminals is provided as inpu
t. A graph H is said to be a distance preserving minor of G if: (i) H is a
minor of G\, and (ii) the distance between each pair of terminals is exac
tly the same in G and H. Note that the edge weights can be reassigned in H
(as long as they are nonnegative). Given a family of graphs F\, let f(k\,
F) be the minimum integer such that every graph in F with k terminals admi
ts a distance preserving minor with at most f(k\,F) vertices. We will see
results for the best known bounds on the value of f for different families
of graphs\, namely trees\, planar graphs and interval graphs.\n
URL:https://www.tcs.tifr.res.in/web/events/569
DTSTART;TZID=Asia/Kolkata:20150120T160000
DTEND;TZID=Asia/Kolkata:20150120T173000
LOCATION:D-405 (D-Block Seminar Room)
END:VEVENT
END:VCALENDAR