Transitive Closure Algorithms Based on Graph Traversal

@article{Ioannidis1993TransitiveCA,
  title={Transitive Closure Algorithms Based on Graph Traversal},
  author={Yannis E. Ioannidis and Raghu Ramakrishnan and Linda Winger},
  journal={ACM Trans. Database Syst.},
  year={1993},
  volume={18},
  pages={512-576}
}
Several graph-based algorithms have been proposed in the literature to compute the transitive closure of a directed graph. We develop two new algorithms (Basic_TC and Gobal_DFTC) and compare the performance of their implementations in a disk-based environment with a well-known graph-based algorithm proposed by Schmitz. Our algorithms use depth-first search to traverse a graph and a technique called marking to avoid processing some of the arcs in the graph. They compute the closure by processing… CONTINUE READING
Highly Cited
This paper has 113 citations. REVIEW CITATIONS
63 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 63 extracted citations

113 Citations

051015'92'97'03'09'15
Citations per Year
Semantic Scholar estimates that this publication has 113 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…