The transitive closue of a directed, acyclic graph can be casually defined as the "reachability matrix" of any given graph. That is, a matrix in which the intersection of any two vertices is either 0, ...

Let G=<V, E> be a directed graph, G*=<V, E*> its transitive closure. Let E* be represented by incidence matrices. Suppose edges are inserted in G one at a time. We consider the problem of efficiently ...

Abstract: The transitive closure of a graph is a new graph where every vertex is directly connected to all vertices to which it had a path in the original graph. Transitive closures are useful for ...

Abstract: A transitive-closure-based test generation algorithm is presented. A test is obtained by determining signal values that satisfy a Boolean equation derived from the neural network model of ...