14 search results - page 1 / 3 » The Simple Reachability Problem in Switch Graphs |
SOFSEM
2009
Springer
14 years 5 months ago
2009
Springer
COCO
2007
Springer
14 years 2 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
CP
2005
Springer
14 years 2 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
PVLDB
2010
13 years 7 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
ECCC
2010
13 years 6 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...