The shortest distance and shortest paths between vertices are very important aspects of Graph Theory. Graphs are often used to represent real-life networks and real-life networks are often prone to failures. Due to those failures, we may want to avoid some edges in the graph at some point of time.
Hence, we may want to find the shortest distance and the shortest path between two vertices while avoiding some edges or vertices in the graph. Fault-tolerant distance oracles are oracles or a set of data structures which can answer those kinds of queries. In my talk, I will be discussing some of our results related to fault-tolerant distance oracles.
Short Bio:
Dipan obtained a B.Sc. (Hons.) in Mathematics from Vidyasagar College (Kolkata) and an M.Sc. in Mathematics from Banaras Hindu University. During his postgraduate studies at Banaras Hindu University, he developed an interest in graph theory. He then joined the CSE discipline at IIT Gandhinagar to pursue a PhD under Prof. Manoj Gupta's supervision. His thesis focuses on fault-tolerant distance oracles, the data structures that can determine distances between vertices while avoiding some edges or vertices. In addition to his thesis work, he has also worked on linear rank width one graphs and power graphs.
