Transitive Closure Algorithm using Binary OR Operation: Primes Algorithm, GHK Algorithm
Year: 2015
Type: article
Abstract: In real world scenarios, transitive closures play a vital role in computer networks RDBMS and Graph theory. An efficient algorithm to find transitive closure is in need. Following paper presents new algorithms to find out Transitive Closure of a Relation Matrix and compares the performance with Warshall algorithm. Sections 3 and 4 explain primes and GHK algorithm respectively. Primes algorithm uses prime numbers to find out transitive closures of a relation, and GHK algorithm uses bit sets to find out the transitive closures of a relation efficiently. Section 4 presents experimental results of Primes and GHK against Warshall‟s algorithm.
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W2969507855
