524 search results - page 9 / 105 » Temporal reachability graphs |
BPM
2007
Springer
14 years 4 months ago
2007
Springer
ICCI
1993
14 years 1 months ago
1993
PVLDB
2011
13 years 19 days ago
2011
LICS
2009
IEEE
14 years 4 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
CIKM
2005
Springer
14 years 3 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...