1 citations · 1 across the 7 of their papers we have counts for
1 paper · 2 filters
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±ε…