A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Fast Algorithm for Calculating Transitive Closures of Binary Relations in the Structure of a Network Object

2021
*
International Scientific Journal of Computing
*

The article proposes a fast algorithm for constructing the transitive closures between all pairs of nodes in the structure of a network object, which can have both directional and non-directional links. The algorithm is based on the disjunctive addition of the elements of certain rows of the adjacency matrix, which models (describe) the structure of the original network object. The article formulates and proves a theorem that using such a procedure, the matrix of transitive closures of a

doi:10.47839/ijc.20.4.2444
fatcat:23xfkdgpqvhczn3xnd4eucyili