Detecting directed 4-cycles still faster
نویسندگان
چکیده
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α.
منابع مشابه
Modular Sieves for Directed Hamiltonian Cycles
We are motivated by a tantalizing open question in exact algorithms: can we detect whether an n-vertex directed graph G has a Hamiltonian cycle in time significantly less than 2? We present new randomized algorithms that improve upon several previous works: a. We show that for any constant 0 < λ < 1 and prime p we can count the Hamiltonian cycles modulo p n 3p ⌋ in expected time less than c for...
متن کاملDistributed cycle detection in large-scale sparse graphs
In this paper we present a distributed algorithm for detecting cycles in large-scale directed graphs, along with its correctness proof and analysis. The algorithm is then extended to find strong components in directed graphs. We indicate an application to detecting cycles in number theoretic functions such as the proper divisor function. Our prototype implementation of the cycle detection algor...
متن کاملMatbase DFS Detecting and Classifying E-RD Cycles Algorithm
A Depth First Search type algorithm for detecting and classifying all cycles of a directed graph was designed and implemented in MatBase for database Entity-Relationship Diagrams. Its time complexity, optimality, and utility for teaching both graph theory, sets, functions, and relations algebra, as well as, especially, for database non-relational constraints discovery and enforcement are discus...
متن کاملacc-Motif Detection Tool
Background: Network motif algorithms have been a topic of research mainly after the 2002-seminal paper from Milo et al, that provided motifs as a way to uncover the basic building blocks of most networks. In Bioinformatics, motifs have been mainly applied in the field of gene regulation networks field. Results: This paper proposes new algorithms to exactly count isomorphic pattern motifs of siz...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 87 شماره
صفحات -
تاریخ انتشار 2003