205 search results - page 3 / 41 » Grid Graph Reachability Problems |
SOFSEM
2009
Springer
14 years 5 months ago
2009
Springer
FMSD
2007
13 years 8 months ago
2007
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
SLP
1997
13 years 10 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
ICDE
2011
IEEE
13 years 7 days ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
FCT
2009
Springer
14 years 12 days ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...