ملخص: We present a method to detect simple cycles of length 4 of a directed graph in O(n1/e2-2/) steps, where n denotes the number of nodes, e denotes the number of edges and is the exponent of matrix multiplication. This improves upon the currently fastest methods for (2/(4-),(+1)/2), where e=n.

لغة: إنجليزية