Consider an unweighted, directed graph G with the diameter D. In this paper, we introduce the framework for counting cycles and walks of given length in matrix multiplication time O ~ ( n ω ) . The framework is based on the fast decomposition into Frobe... ...

请注册登录后继续浏览