Results 241 to 250 of about 2,112 (254)

Nested Pebbles and Transitive Closure

2006
First-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

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   +2 more sources

The dimension of the negation of transitive closure

Journal of Symbolic Logic, 1995
AbstractWe prove that any positive elementary (least fixed point) induction expressing the negation of transitive closure on finite nondirected graphs requires at least two recursion variables.
openaire   +2 more sources

An improved transitive closure algorithm

Computing, 1983
Several efficient transitive closure algorithms operate on the strongly connected components of a digraph, some of them using Tarjan's algorithm [17]. Exploiting facts from graph theory and the special properties of Tarjan's algorithm we develop a new, improved algorithm.
openaire   +2 more sources

Transitive-Closure Spanners: A Survey

2010
We survey results on transitive-closure spanners and their applications. 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, EH) that has (1) the same transitive-closure as G and (2) diameter at most k.
openaire   +2 more sources

Caching transitive closures

Proceedings of the 19th annual conference on Computer Science - CSC '91, 1991
John Sieg, Chandon Chitale
openaire   +2 more sources

Shortest Paths and Transitive Closure

1992
Let G = (V, E) be an undirected graph and let l be a function assigning a nonnegative length to each edge. Extend l to domain V x V by defining l(υ, υ) = 0 and l(u, υ) = ∞ if (u, υ) ∉ E. Define the length2 of a path \( p = {e_{1}}{e_{2}}...{e_{n}}{\text{ to be }}l(p) = \Sigma _{{i = 1}}^{n}l({e_{i}}). \).
openaire   +2 more sources

Closure on Transition Curves [PDF]

Transactions of the American Society of Civil Engineers, 1901
openaire   +1 more source

Closure to “Innovations in Mass Transit” [PDF]

Journal of the Urban Planning and Development Division, 1969
openaire   +1 more source

Transitions and Closures

2017
openaire   +1 more source