BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260411T110119Z
UID:Seminar-dept-1081@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20231212T130000
DTEND:20231212T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Dibyayan Chakraborty: Isometric path complexity of graphs\n\nIsometric path of a graph is a shortest path between its end-vertices. A collection of isometric paths is `''rooted'' if all of them starts from the same vertex. Isometric path complexity (ipco (G)) of a graph G is the minimum number of ''rooted'' isometric paths required to cover any isometric path of the graph. \n\n\n\nEven though this parameter was initially conceptualised to design constant factor approximation algorithms for a particular optimisation problem called "ISOMETRIC PATH COVER", it was shown to be bounded for some interesting and seemingly different graph classes.\n\n\n\nIn this talk, we will discuss the known results and some techniques to bound this parameter on interesting graph classes. \n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1081
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR