Efficient transitive closure computation in large digraphs

Let D be a digraph, V ( D ) and A ( D ) will denote the sets of vertices and arcs of D , respectively. A subset N of V ( D ) is k -independent if for every pair of vertices u , v N , we have d ( u , v ) , d ( v , u ) k ; it is l -absorbent if for every ...

An algorithm is given for computing the transitive closure of a directed graph in a time no greater thana ₁ N ₁ n+a ₂ n ² for largen wherea ₁ anda ₂ are constants depending on the computer used to execute the algorithm,n is the number of nodes in the graph ...

A digraph is distance–transitive if for every integer s ≥ 0, the automorphism group of the digraph is transitive on pairs ( u , v ) of vertices for which there is a directed path of length s from u to v, but no directed path of length ...