# Transitive closure

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2004

Highly Cited

2004

- CSL
- 2004

To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we canâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs

- FOCS
- 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

- J. Comput. Syst. Sci.
- 1997

Computing the transitive closure in directed graphs is a fundamental graph problem. We consider the more restricted problem ofâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- FOCS
- 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

Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles

- IJCAI
- 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

- SPAA
- 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)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Random Struct. Algorithms
- 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)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- ACM Trans. Database Syst.
- 1990

An important feature of database support for expert systems is the ability of the database to answer queries regarding theâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- ACM Trans. Database Syst.
- 1990

We present new algorithms for computing transitive closure of large database relations. Unlike iterative algorithms, such as theâ€¦Â (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- SIAM J. Comput.
- 1972

We consider economical representations for the path information in a directed graph. A directed graph G is said to be aâ€¦Â (More)

Is this relevant?