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.