Results 221 to 230 of about 2,112 (254)
Some of the next articles are maybe not open access.
Aggregative closure: an extension of transitive closure
[1989] Proceedings. Fifth International Conference on Data Engineering, 2003The aggregative closure operator is defined and its usefulness is demonstrated in a wide variety of applications. The concepts and definitions of closed semirings and the aggregating relational operators provide a mathematical framework for the presentation of algorithms for these applications.
Theodore S. Norvell, Isabel F. Cruz
openaire +2 more sources
Transitive Closure And Testing [PDF]
, 1991 In previous chapters, we used transitive closure to speed up the energy minimization algorithms. Now we present a test generation algorithm entirely based on transitive closure. A test is obtained by determining signal values that satisfy a Boolean expression constructed from the circuit netlist and the fault.
Vishwani D. Agrawal +2 more
openaire +1 more source
Algorithms for transitive closure
Information Processing Letters, 2002Abstract Let σ ′( n ) denote the number of all strongly connected graphs on the n -element set. We prove that σ ′( n )⩾2 n 2 ·(1− n ( n −1)/2 n −1 ). Hence the algorithm computing a transitive closure by a reduction to acyclic graphs has the expected time O( n 2 ), under the assumption of uniform distribution of input graphs.
Alena Koubková, Václav Koubek
openaire +2 more sources
A Transition Closure Model for Predicting Transition Onset
SAE Technical Paper Series, 1997A unified approach which makes it possible to determine the extent and onset of transition in one calculation is presented. It treats the laminar fluctuations in a manner similar to that used in describing turbulence. As a result, the complete flowfield can be calculated using existing CFD codes and without the use of stability codes.
Eric Warren +3 more
openaire +3 more sources
On computing the transitive closure of a relation
Acta Informatica, 1977An algorithm is presented for computing the transitive closure of an arbitrary relation which is based upon Tarjan's algorithm [7] for finding the strongly connected components of a directed graph. A new formulation, justifying a somewhat simplified statement of the latter, characterises weaker restrictions on the form of the graph traversal than ...
R. Kurki-Suonio, J. Eve
openaire +2 more sources
Multiprocessor Transitive Closure Algorithms
Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems, 2005We present parallel algorithms to compute the transitive closure of a database relation. These algorithms are applicable both on shared-memory and message-passing architectures. Experimental verification shows an almost linear speed-up with these algorithms.
H. V. Jagadish, Rakesh Agrawal
openaire +2 more sources
Transitive closure, proximity and intransitivities
Economic Theory, 2003Assignments of weak orders to complete binary relations are considered. Firstly, it is shown that assigning the transitive closure of a complete binary relation does not always assign the closest weak order according to any reasonable metric on complete binary relations. It is then shown that the assignment of a weak order to a complete binary relation
Christian Klamler, Nick Baigent
openaire +2 more sources
Efficient computation of transitive closures
Fuzzy Sets and Systems, 1990Abstract We describe an efficient, time-space balanced algorithm for computation of the transitive max-min closure of a proximity relation, i.e. of a fuzzy relation that is reflexive and symmetric. The algorithm creates a binary tree representation of the transitive closure in O( m log 2 m ) time and O( m ) space, where m is the number of edges ...
Ronald R. Yager, H. Legind Larsen
openaire +2 more sources
Well-foundedness and the transitive closure
1992The transitive closure of relation R is defined as the strongest relation S that satisfies for all x,y (in the domain of R) $$\rm xSy \eq xRy \vee ({\b E}z: zRy: xSz).$$
A. J. M. van Gasteren +1 more
openaire +3 more sources