![Algorithmic Spectral Graph Theory_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Algorithmic%20Spectral%20Graph%20Theory_hi-res.jpg?h=bc58dfd7&itok=8NAdfoPF)
Abstract
In recent years, there was an emergence of new type of fast algorithms for various fundamental graph problems. A key object employed in these algorithms are electrical flows, which correspond to solutions to Laplacian linear systems.
In this talk, I will discuss this central role of electrical flows in all these developments, as well as sketch their potential further applications in graph algorithms.