1650 search results - page 64 / 330 » The HOM problem is decidable |
EOR
2010
13 years 10 months ago
2010
The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbor...
DAM
2006
13 years 10 months ago
2006
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a ...
FORMATS
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
MICCAI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. In analyzing diffusion magnetic resonance imaging, multitensor models address the limitations of the single diffusion tensor in situations of partial voluming and fiber c...
RP
2010
Springer
13 years 8 months ago
2010
Springer
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...