A new algorithm for computing transitive closures

  • Authors:

  • Yangjun Chen

  • Affiliations:

  • University of Winnipeg, Manitoba, Canada

  • Venue:
  • Proceedings of the 2004 ACM symposium on Applied computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a new algorithm for computing transitive closures. It needs only O(e·b) time and O(n·b) space, where n represents the number of the nodes of a DAG (directed acyclic graph), e the numbers of the edges, and b the DAG's breadth.