18 search results - page 4 / 4 » Strongly adjacency-transitive graphs and uniquely shift-tran... |
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
CONCUR
2009
Springer
13 years 12 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
SIAMAM
2010
13 years 3 months ago
2010
This paper concerns the dynamical behavior of weakly reversible, deterministically modeled population processes near the facets (codimension-one faces) of their invariant manifolds...