34 search results - page 1 / 7 » The Reachability Problem over Infinite Graphs |
CSR
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
MST
2006
13 years 4 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...
DAGSTUHL
2008
13 years 6 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
FOSSACS
2009
Springer
13 years 8 months ago
2009
Springer
We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes ...
VLDB
2012
ACM
12 years 2 days ago
2012
ACM
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...