Yangjun Chen
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.
- D. E. Knuth, The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, 1969. Google Scholar
Digital Library
- J. Tarjan: Finding Optimum Branching, Networks, 7. 1977, pp. 25-35.Google Scholar
Index Terms
- A new algorithm for computing transitive closures
Recommendations
A transitive closure algorithm
AbstractAn algorithm is given for computing the transitive closure of a directed graph in a time no greater thana 1 N 1 n+a 2 n 2 for largen wherea 1 anda 2 are constants depending on the computer used to execute the algorithm,n is the number of nodes in the graph ...
On the transitive closure representation and adjustable compression
SAC '06: Proceedings of the 2006 ACM symposium on Applied computingA composite object represented as a directed graph (digraph for short) is an important data structure that requires efficient support in CAD/CAM, CASE, office systems, software management, web databases, and document databases. It is cumbersome to ...
Computing transitive closure on systolic arrays of fixed size
Forming the transitive closure of a binary relation (or directed graph) is an important part of many algorithms. When the relation is represented by a bit matrix, the transitive closure can be efficiently computed in parallel in a systolic array.Here we ...
Comments