307 search results - page 37 / 62 » Finite locally-quasiprimitive graphs |
MST
2006
13 years 9 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
GG
2010
Springer
13 years 11 months ago
2010
Springer
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
MFCS
1997
Springer
14 years 2 months ago
1997
Springer
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...
TPDS
2008
13 years 9 months ago
2008
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...