Extensor-Coding

Cornelius Brand, Holger Dell, Thore Husfeldt

We devise an algorithm that approximately computes the number of paths of length $k$ in a given directed graph with $n$ vertices up to a multiplicative error of $1\pm \epsilon$…