Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Leibowitz, Oree"'
In this note we present an algorithm that lists all $4$-cycles in a graph in time $\tilde{O}(\min(n^2,m^{4/3})+t)$ where $t$ is their number. Notably, this separates $4$-cycle listing from triangle-listing, since the latter has a $(\min(n^3,m^{3/2})+
Externí odkaz:
http://arxiv.org/abs/2211.10022
