A transitive closure algorithm

  title={A transitive closure algorithm},
  author={Paul Walton Purdom},
  journal={BIT Numerical Mathematics},
  • P. Purdom
  • Published 1 March 1970
  • Mathematics, Computer Science
  • BIT Numerical Mathematics
An algorithm is given for computing the transitive closure of a directed graph in a time no greater thana1N1n+a2n2 for largen wherea1 anda2 are constants depending on the computer used to execute the algorithm,n is the number of nodes in the graph andN1 is the number of arcs (not counting those arcs which are part of a cycle and not counting those arcs which can be removed without changing the transitive closure). For graphs where each arc is selected at random with probabilityp, the average… 
An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs
A new algorithm is described to compute the transitive closure of a circuit-free graph, the complexity of which (in the worst-case sense) is better than O(MN) (M being the number of arcs and N the number-degrees bounded by some fixed constant K).
On computing the transitive closure of a relation
An algorithm is presented for computing the transitive closure of an arbitrary relation which is based upon Tarjan's algorithm for finding the strongly connected components of a directed graph, and combines the advantages of Warshall's algorithm, namely, succinctness, a single traversal of the directed graph and ability to exploit the availability of Boolean vector operations.
Transitive closure algorithms based on graph traversal
The results indicate that all graph-based algorithms significantly outperform other types of algorithms such as Seminaive and Warren and to the extent possible, adapt these algorithms to perform path computations.
Computing transitive closure on systolic arrays of fixed size
  • B. Lisper
  • Computer Science
    Distributed Computing
  • 2005
This work proposes two novel ways of computing the transitive closure of an arbitrarily big graph on a systolic array of fixed size using a block-structured algorithm and a simple partitioning of a well-known syStolic algorithm.
A Fully Polynomial Parameterized Algorithm for Counting the Number of Reachable Vertices in a Digraph
This paper presents an O( f 3n)-time exact algorithm, where n is the number of vertices in G and f is the feedback edge number of G, which runs in truly subquadratic time for digraphs of f = O(n 3−e) for any e > 0.
The Transitive Reduction of a Directed Graph
It is shown that the time complexity of the best algorithm for finding the transitive reduction of a graph is the same as the time to compute the transitives closure of agraph or to perform Boolean matrix multiplication.
A new algorithm for transitive closures and computation of recursion in relational databases
  • Yangjun Chen
  • Mathematics, Computer Science
    Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.
  • 2003
The main idea behind this algorithm is tree labeling and graph decomposition, based on which the transitive closure of a directed graph can be computed in O time and in O space, can be used to efficiently compute recursive relationships of adirected graph in a relational environment.
On the calculation of transitive reduction - closure of orders
Classes of directed acyclic graphs for which problems can be solved in linear time complexity are proposed, namely: generalized N-free graphs, graphs such that the external or internal degree of any vertex is bounded in the transitive reduction, and bounded decomposition width orders, strongly W-free orders.
On the transitive closure representation and adjustable compression
A new encoding method to label a digraph is presented, which reduces the footprints of all previous strategies for recognizing recursive relationships and leads to a new algorithm for computing transitive closures for DAGs (directed acyclic graph) in O(e·b) time and O(n· b) space.
Efficient Parallel Implementation of Transitive Closure of Digraphs
Based on a CGM/BSP parallel algorithm for computing the transitive closure of an acyclic directed graph (digraph), a modified version that works for any digraph and does not use the linear extension labeling is presented.


An algorithm for computing all paths in a graph
I t is well known tha t B and A are connected by the equation B = (A + I) n-l, where I denotes the unit matrix, and the summation involved in the computation of the matrix elements shall be carried
A Theorem on Boolean Matrices
It is proved the validity of an algorithm whose running time goes up slightly faster than the square of d, the running times of which increase-other things being equal-as the cube of d.
EULER: a generalization of ALGOL and it formal definition: Part 1
In this section the algorithmic language EULER is described first informally and then formally by its syntax and semantics, creating a language which is simpler and yet more flexible than ALGOL 60.
Topological sorting of large networks
The approach to the problem presented here centers upon the use of multiple adaptive matched filters that classify normalized signals that compare between machine and human performance.
The Art of Computer Programming
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.