Results 271 to 280 of about 54,023 (317)

Fast Dynamic Transitive Closure with Lookahead

Algorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sankowski, Piotr, Mucha, Marcin
openaire   +2 more sources

Cache-friendly implementations of transitive closure

Proceedings 2001 International Conference on Parallel Architectures and Compilation Techniques, 2002
The topic of cache performance has been well studied in recent years. Compiler optimizations exist and optimizations have been done for many problems. Much of this work has focused on dense linear algebra problems. At first glance, the Floyd--Warshall algorithm appears to fall into this category.
Michael Penner, Viktor K. Prasanna
openaire   +1 more source

Parallel transitive closure and transitive reduction algorithms

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications, 2002
The authors provide distinct algorithms for computing transitive closure and transitive reduction with sequential time complexities of O( Sigma e/sub i/) and O(n/sup 2/+ Sigma e/sub i/), respectively, and parallel time complexities of O(e/sub i/) And O(n+e/sub i/), respectively.
P. Chang, L.J. Henschen
openaire   +1 more source

Transitive Closure And Testing

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.
Srimat T. Chakradhar, Vishwani D. Agrawal, Michael L. Bushneil   +2 more
openaire   +1 more source

Redundancy identification using transitive closure

Proceedings of the Fifth Asian Test Symposium (ATS'96), 2002
We analyze all signals of a combinational circuit simultaneously for redundancy. The state of a signal is represented by two binary variables. The first variable is the logic value of the signal. The second variable is the observability status of the signal with respect to all primary outputs.
V.D. Agrawal, M.L. Bushnell, null Qing Lin   +2 more
openaire   +1 more source

Dynamic Plane Transitive Closure

2007
In 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

Transitive closure, proximity and intransitivities

Economic Theory, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baigent, Nick, Klamler, Christian
openaire   +1 more source

Efficient computation of transitive closures

Fuzzy Sets and Systems, 1990
The paper provides an algorithm for calculation of transitive closure (max-min closure) of a fuzzy proximity relation (i.e., a relation that is reflexive and symmetric). The studied algorithm creates a binary tree representation of the closure in O(n log\({}_ 2n)\) time and O(n) space where ``n'' is the dimension of the relation.
Larsen, H. Legind, Yager, R. R.
openaire   +2 more sources

On transitive closure logic

2005
We present Ehrenfeucht-Fraisse games for transitive closure logic (FO + TC) and for quantifier classes in (FO + TC). With this method we investigate the fine structure of positive transitive closure logic (FO + pos TC), and identify an infinite quantifier hierarchy inside (FO + pos TC), formed by interleaving universal quantifiers and TC-operators.
openaire   +1 more source

Complementation and Transitive Closure

1999
Over infinite structures, there is a strict hierarchy of languages that is obtained by alternating uses of the least-fixed point operator and negation. For finite structures, we show that the hierarchy collapses to its first-level.
openaire   +1 more source