205 search results - page 2 / 41 » Grid Graph Reachability Problems |
ESOP
2009
Springer
13 years 10 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
DLT
2008
13 years 7 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
CCCG
2006
13 years 7 months ago
2006
We study the Hamiltonian Cycle problem in graphs induced by subsets of the vertices of the tiling of the plane with equilateral triangles. By analogy with grid graphs we call such...
COCO
2010
Springer
13 years 10 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
MST
2006
13 years 6 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...