Mixed-approach algorithms for transitive closure (extended abstract)

We study two different approaches for computing the transitive closure of a directed graph and show that, in some sense, they are “dual” on edge-reversed graphs but, nevertheless, can differ asymptotically in cost on the same family of graphs. We show how the two approaches can be mixed into a new algorithm using reachability trees. We show that the new algorithm is o(~(~,yj~vxv CON~(Z, y)) where COMV(z, y) is the pairwise connectivity of z and y, and give a more exact connectivity-based upper bound that is better than the lower bound for a wide class of other algorithms on every family of graphs.

[1]  Raghu Ramakrishnan,et al.  Efficient Transitive Closure Algorithms , 1988, VLDB.

[2]  Giuseppe F. Italiano,et al.  Finding Paths and Deleting Edges in Directed Acyclic Graphs , 1988, Inf. Process. Lett..

[3]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[4]  Giuseppe F. Italiano,et al.  Amortized Efficiency of a Path Retrieval Data Structure , 1986, Theor. Comput. Sci..

[5]  François Bancilhon,et al.  Naive Evaluation of Recursively Defined Relations , 1986, On Knowledge Base Management Systems.

[6]  Kurt Mehlhorn,et al.  Graph Algorithm and NP-Completeness , 1984 .

[7]  Jürgen Ebert,et al.  A Sensitive Transitive Closure Algorithm , 1981, Inf. Process. Lett..

[8]  Václav Koubek,et al.  A Reduct-and-Closure Algorithm for Graphs , 1979, MFCS.

[9]  Claus-Peter Schnorr,et al.  An Algorithm for Transitive Closure with Linear Expected Time , 1978, SIAM J. Comput..

[10]  Henry S. Warren,et al.  A modification of Warshall's algorithm for the transitive closure of binary relations , 1975, Commun. ACM.

[11]  Paul Walton Purdom,et al.  A transitive closure algorithm , 1970, BIT.

[12]  Michael J. Fischer,et al.  A Note on the Average Time to Compute Transitive Closures , 1976, ICALP.

[13]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[14]  J. Ian Munro,et al.  Efficient Determination of the Transitive Closure of a Directed Graph , 1971, Inf. Process. Lett..

[15]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.