Seminar • Algorithms and Complexity • Distance-Estimation in Modern Graphs: Algorithms and Impossibility
Please note: This seminar will take place in DC 1304 and virtually over Zoom.
Nicole Wein, Simons Postdoctoral Leader
DIMACS, Rutgers University
The size and complexity of today’s graphs present challenges that necessitate the discovery of new algorithms. One central area of research in this endeavor is computing and estimating distances in graphs. In this talk I will discuss two fundamental families of distance problems in the context of modern graphs: Diameter/Radius/Eccentricities and Hopsets/Shortcut Sets.
Please note: This PhD seminar will take place online.
Tim Dockhorn, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Yaoliang Yu