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)

Related topics

Related topics

50 relations
2-satisfiabilityAbstract family of acceptorsAbstract rewriting systemBreadth-first search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Hidden Technical Debt in Machine Learning Systems
Machine learning offers a fantastically powerful toolkit for building useful complex prediction systems quickly. This paper… 
Highly Cited
1999
Highly Cited
1999
Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs
  • Valerie King
  • 40th Annual Symposium on Foundations of Computer…
  • 1999
  • Corpus ID: 2891724
This paper presents the first fully dynamic algorithms for maintaining all-pairs shortest paths in digraphs with positive integer… 
Highly Cited
1997
Highly Cited
1997
Size-Estimation Framework with Applications to Transitive Closure and Reachability
  • E. Cohen
  • Journal of computer and system sciences (Print)
  • 1997
  • Corpus ID: 6210950
Computing the transitive closure in directed graphs is a fundamental graph problem. We consider the more restricted problem of… 
Highly Cited
1995
Highly Cited
1995
Fully dynamic biconnectivity and transitive closure
This paper presents an algorithm for the fully dynamic biconnectivity problem whose running time is exponentially faster than all… 
Highly Cited
1990
Highly Cited
1990
High-probability parallel transitive closure algorithms
There is a straightforward algorithm for computing the transitive-closure of an n-node graph in $O(\log ^2 n)$ time on an EREW… 
Highly Cited
1990
Highly Cited
1990
A compression technique to materialize transitive closure
An important feature of database support for expert systems is the ability of the database to answer queries regarding the… 
Highly Cited
1990
Highly Cited
1990
The Transitive Closure of a Random Digraph
  • R. Karp
  • Random Struct. Algorithms
  • 1990
  • Corpus ID: 17203046
In a random n-vertex digraph, each arc is present with probability p, independently of the presence or absence of other arcs. We… 
Highly Cited
1974
Highly Cited
1974
Developing Interconnection Matrices in Structural Modeling
A procedure is described for developing an interconnection matrix that specifies a cascade connection of two known digraphs to… 
Highly Cited
1972
Highly Cited
1972
The Transitive Reduction of a Directed Graph
We consider economical representations for the path information in a directed graph. A directed graph $G^t $ is said to be a… 
Highly Cited
1971
Highly Cited
1971
Boolean Matrix Multiplication and Transitive Closure
Arithmetic operations on matrices are applied to the problem of finding the transitive closure of a Boolean matrix. The best… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)