Skip to search formSkip to main contentSkip to account menu

Transitive closure

Known as: Transitive Closure of R, Recursive closure, Transitive closure logic 
In mathematics, the transitive closure of a binary relation R on a set X is the smallest relation on X that contains R and is transitive. For example… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The paper deals with some structural properties of propelinear binary codes, in particular propelinear perfect binary codes. We… 
2003
2003
We examine the organizational impact on phylogenetic databases of the increasing sophistication in the need and use of… 
2001
2001
We show cache friendly implementations of the Floyd-Warshall algorithm for the all-pairs shortest-path problem. We first compare… 
1995
1995
We prove that tree isomorphism is not expressible in the language (FO+TC+COUNT). This is surprising since in the presence of… 
1993
1993
Addresses the problem of fragmenting a relation to make the parallel computation of the transitive closure efficient, based on… 
1992
1992
The authors present a transitive closure algorithm that maintains a spanning tree of successors for each node rather than a… 
1992
1992
Using a directed acyclic graph (DAG) model of algorithms, the authors focus on processor-time-minimal multiprocessor schedules… 
1992
1992
We consider the problem of repeatedly evaluating the same (computationally expensive) query to a database that is being updated… 
Highly Cited
1990
Highly Cited
1990
We present a new family of hybrid transitive closure algorithms, and present experimental results showing that these algorithms… 
1990
1990
This paper deals with one of the most common and important types of recursion: transitive closure. Since many real world problems…