Results 11 to 20 of about 1,578 (264)
Transitive Closures of Ternary Fuzzy Relations [PDF]
International Journal of Computational Intelligence Systems, 2021 Recently, we have introduced six types of composition of ternary fuzzy relations. These compositions are close in spirit to the composition of binary fuzzy relations.
Lemnaouar Zedam, Bernard De Baets
doaj +4 more sources
Transitive-Closure Spanners [PDF]
SIAM Journal on Computing, 2009 Given a directed graph G = (V,E) and an integer k>=1, a k-transitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, E_H) that has (1) the same transitive-closure as G and (2) diameter at most k. These spanners were implicitly studied in access control, data structures, and property testing, and properties of these spanners have been
Arnab Bhattacharyya 0001 +4 more
openaire +6 more sources
Complements and transitive closures
Discrete Mathematics, 1972 AbstractThe complement of the transitive closure of the complement of a transitive relation is transitive. We prove this fact in three ways, analyze the underlying structure and consider various refinement's and applications.
Ronald L. Graham +2 more
openaire +3 more sources
Parallel transitive closure algorithm [PDF]
Journal of the Brazilian Computer Society, 2012 Abstract Using the BSP/CGM model, with $$p$$ processors, where $$p \ll n$$ , we present a parallel algorithm to compute the transitive closure of a digraph $$D$$ with $$n$$ vertices and $$m$$ edges.
C. E. R. Alves +4 more
openaire +2 more sources
Dual digraphs of finite semidistributive lattices
Cubo, 2022 Dual digraphs of finite join-semidistributive lattices, meet-semidistributive lattices and semidistributive lattices are characterised. The vertices of the dual digraphs are maximal disjoint filter-ideal pairs of the lattice.
Andrew Craig +2 more
doaj +1 more source
Tree Canonization and Transitive Closure
Information and Computation, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Etessami, E, Immerman, N
openaire +4 more sources
Derivatives on Graphs for the Positive Calculus of Relations with Transitive Closure [PDF]
Logical Methods in Computer ScienceWe prove that the equational theory of the positive calculus of relations with transitive closure (PCoR*) is EXPSPACE-complete. Here, PCoR* terms consist of the following standard operators on binary relations: identity, empty, universality, union ...
Yoshiki Nakamura
doaj +1 more source
Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We present a new approach to the logical design of relational databases, based on strategic port graph rewriting. We show how to model relational schemata as attributed port graphs and provide port graph rewriting rules to perform computations on ...
János Varga
doaj +1 more source
On Generalized Transitive Matrices
Journal of Applied Mathematics, 2011 Transitivity of generalized fuzzy matrices over a special type of semiring is considered. The semiring is called incline algebra which generalizes Boolean algebra, fuzzy algebra, and distributive lattice.
Jing Jiang, Lan Shu, Xinan Tian
doaj +1 more source
On Invoking Transitivity to Enhance the
IEEE Access, 2018 From the earliest studies in graph theory, the phenomenon of transitivity has been used to design and analyze problems that can be mapped onto graphs. Some of the practical examples of this phenomenon are the “Transitive Closure”algorithm ...
Abdolreza Shirvani, B. John Oommen
doaj +1 more source