Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,760 papers from all fields of science
Search
Sign In
Create Free Account
Transitive closure
Known as:
Transitive Closure of R
, Recursive closure
, Transitive closure logic
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
2-satisfiability
Abstract family of acceptors
Abstract rewriting system
Breadth-first search
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Structural properties of binary propelinear codes
J. Borges
,
I. Mogilnykh
,
J. Rifà
,
F. Solov'eva
Advances in Mathematics of Communications
2012
Corpus ID: 36194736
The paper deals with some structural properties of propelinear binary codes, in particular propelinear perfect binary codes. We…
Expand
2003
2003
Requirements of phylogenetic databases
Luay K. Nakhleh
,
Daniel P. Miranker
,
François Barbançon
,
W. H. Piel
,
M. Donoghue
Third IEEE Symposium on Bioinformatics and…
2003
Corpus ID: 2542913
We examine the organizational impact on phylogenetic databases of the increasing sophistication in the need and use of…
Expand
2001
2001
Cache-friendly implementations of transitive closure
Michael Penner
,
V. Prasanna
Proceedings International Conference on Parallel…
2001
Corpus ID: 2455731
We show cache friendly implementations of the Floyd-Warshall algorithm for the all-pairs shortest-path problem. We first compare…
Expand
1995
1995
Tree canonization and transitive closure
K. Etessami
,
N. Immerman
Proceedings of Tenth Annual IEEE Symposium on…
1995
Corpus ID: 12026606
We prove that tree isomorphism is not expressible in the language (FO+TC+COUNT). This is surprising since in the presence of…
Expand
1993
1993
Data fragmentation for parallel transitive closure strategies
M. Houtsma
,
P. Apers
,
Gideon L. V. Schipper
Proceedings of IEEE 9th International Conference…
1993
Corpus ID: 10016993
Addresses the problem of fragmenting a relation to make the parallel computation of the transitive closure efficient, based on…
Expand
1992
1992
A spanning tree transitive closure algorithm
Shaul Dar
,
H. V. Jagadish
[] Eighth International Conference on Data…
1992
Corpus ID: 20184064
The authors present a transitive closure algorithm that maintains a spanning tree of successors for each node rather than a…
Expand
1992
1992
A Processor-Time-Minimal Systolic Array for Transitive Closure
C. Scheiman
,
P. Cappello
IEEE Trans. Parallel Distributed Syst.
1992
Corpus ID: 36237472
Using a directed acyclic graph (DAG) model of algorithms, the authors focus on processor-time-minimal multiprocessor schedules…
Expand
1992
1992
Incremental Evaluation of Datalog Queries
Guozhu Dong
,
R. Topor
International Conference on Database Theory
1992
Corpus ID: 206637000
We consider the problem of repeatedly evaluating the same (computationally expensive) query to a database that is being updated…
Expand
Highly Cited
1990
Highly Cited
1990
Hybrid Transitive Closure Algorithms
R. Agrawal
,
H. V. Jagadish
Very Large Data Bases Conference
1990
Corpus ID: 13570661
We present a new family of hybrid transitive closure algorithms, and present experimental results showing that these algorithms…
Expand
1990
1990
Distributed Transitive Closure Computations: The Disconnection Set Approach
M. Houtsma
,
P. Apers
,
S. Ceri
Very Large Data Bases Conference
1990
Corpus ID: 9019095
This paper deals with one of the most common and important types of recursion: transitive closure. Since many real world problems…
Expand
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)
ACCEPT & CONTINUE