Results 1 to 10 of about 53,801 (280)
Transitive-Closure Spanners [PDF]
SIAM Journal on Computing, 2009 Given a directed graph G = (V,E) and an integer k>=1, a k-transitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, E_H) that has (1) the same transitive-closure as G and (2) diameter at most k. These spanners were implicitly studied in access control, data structures, and property testing, and properties of these spanners have been
Bhattacharyya, A Bhattacharyya, Arnab +4 more
openaire +5 more sources
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]
, 2007 String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure.
Hendrik Jan Hoogeboom +2 more
core +6 more sources
Transitive closure and transitive reduction in bidirected graphs [PDF]
Czechoslovak Mathematical Journal, 2019 In a bidirected graph an edge has a direction at each end, so bidirected graphs generalize directed graphs. We generalize the definitions of transitive closure and transitive reduction from directed graphs to bidirected graphs by introducing new notions of bipath and bicircuit that generalize directed paths and cycles.
Bessouf, Ouahiba +2 more
openaire +4 more sources
Transitive Closures of Ternary Fuzzy Relations [PDF]
International Journal of Computational Intelligence Systems, 2021 Recently, we have introduced six types of composition of ternary fuzzy relations. These compositions are close in spirit to the composition of binary fuzzy relations. Based on these types of composition, we have introduced several types of transitivity of a ternary fuzzy relation and investigated their basic properties.
Zedam, Lemnaouar, De Baets, Bernard
openaire +3 more sources
Parallel transitive closure algorithm [PDF]
Journal of the Brazilian Computer Society, 2012 Abstract Using the BSP/CGM model, with $$p$$ processors, where $$p \ll n$$ , we present a parallel algorithm to compute the transitive closure of a digraph $$D$$ with $$n$$ vertices and $$m$$ edges.
C. E. R. Alves +4 more
openaire +1 more source
A survey of parallel execution strategies for transitive closure and logic programs [PDF]
, 1993 An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for ...
Cacace, F., Ceri, S., Houtsma, M.A.W.
core +4 more sources
On the Cost of Transitive Closures in Relational Databases [PDF]
, 1993 We consider the question of taking transitive closures on top of pure relational systems (Sybase and Ingres in this case). We developed three kinds of transitive closure programs, one using a stored procedure to simulate a built-in transitive closure ...
Li, Zhe, Ross, Kenneth A.
core +2 more sources
Data fragmentation for parallel transitive closure strategies [PDF]
, 1993 Addresses the problem of fragmenting a relation to make the parallel computation of the transitive closure efficient, based on the disconnection set approach. To better understand this design problem, the authors focus on transportation networks.
Apers, Peter M.G. +3 more
core +2 more sources
Tree Canonization and Transitive Closure
Information and Computation, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Etessami, E, Immerman, N
openaire +2 more sources
Computing transitive closures of hedge transformations [PDF]
International Journal of Critical Computer-Based Systems, 2007 We consider the framework of regular hedge model checking where configurations are represented by trees of arbitrary arities, sets of configurations are represented by regular hedge automata, and the dynamic of a system is modelled by a term rewriting system. We consider the problem of computing the transitive closure R*(L) of a hedge automaton L and a
openaire +2 more sources