Results 211 to 220 of about 1,578 (264)
A transitive closure algorithm [PDF]
BIT Numerical Mathematics, 1970 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
Paul Purdom
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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.
Isabel F. Cruz, Theodore S. Norvell
openaire +1 more source
Algorithms for transitive closure
Information Processing Letters, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alena Koubková, Václav Koubek
openaire +1 more source
Transitive closure and betweenness relations
Fuzzy Sets and Systems, 2001Peer ...
Boixader Ibáñez, Dionís +2 more
openaire +4 more sources
Transitive dependencies in transaction closures
Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156), 2002Complex applications consist of a large set of transactions which are interrelated. There are different kinds of dependencies among transactions of a complex application, e.g. termination or execution dependencies which are constraints on the occurrence of significant transaction events.
Kerstin Schwarz +2 more
openaire +1 more source
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 ...
J. Eve, Reino Kurki-Suonio
openaire +2 more sources
Dynamic Plane Transitive Closure
2007In this paper we study the problem of transitive closure in dynamic directed plane graphs. We show a dynamic algorithm supporting updates and queries in worst-case O(√n) time. This is the first known algorithm for this problem with almost linear update time and query time product.
Krzysztof Diks, Piotr Sankowski
openaire +1 more source
Polynomial Space and Transitive Closure
SIAM Journal on Computing, 1979A characterization of PSPACE in terms of the regular sets and certain algebraic closure operations is developed. It is shown that NP = PSPACE if and only if NP is closed under a form of the transitive closure operation.
openaire +3 more sources
Nested Pebbles and Transitive Closure
2006First-order logic with k-ary deterministic transitive closure has the same power as two-way k-head deterministic automata that use a finite set of nested pebbles. This result is valid for strings, ranked trees, and in general for families of graphs having a fixed automaton that can be used to traverse the nodes of each of the graphs in the family ...
Joost Engelfriet, Hendrik Jan Hoogeboom
openaire +2 more sources
A Transition Closure Model for Predicting Transition Onset
SAE Technical Paper Series, 1997<div class="htmlview paragraph">A 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
E. S. Warren, H. A. Hassan
openaire +1 more source