Abstract
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 er......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
