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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper presents the first fully dynamic algorithms for maintaining all-pairs shortest paths in digraphs with positive integer… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Computing the transitive closure in directed graphs is a fundamental graph problem. We consider the more restricted problem of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper presents an algorithm for the fully dynamic biconnectivity problem whose running time i s exponentially faster than… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
In Baader (1990a,1990b), we have considered different types of semantics for terminologicial cycles in the concept language FL0… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
There is a straightforward algorithm for computing the transitive closure of an n-node directed graph in O(log2 n) time on an… (More)
  • figure 2.1
  • figure 3.1
  • figure 4.2
  • figure 5.2
  • figure 5.4
Is this relevant?
Highly Cited
1990
Highly Cited
1990
In a random n-vertex digraph, each arc is present with probability p, independently of the presence or absence of other arcs. We… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
1990
Highly Cited
1990
An important feature of database support for expert systems is the ability of the database to answer queries regarding the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We present new algorithms for computing transitive closure of large database relations. Unlike iterative algorithms, such as the… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1972
Highly Cited
1972
We consider economical representations for the path information in a directed graph. A directed graph G is said to be a… (More)
  • figure 1
  • figure 2
Is this relevant?