4218 search results - page 35 / 844 » Complete sets of cooperations |
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Completely iterative algebras (cias) are those algebras in which recursive equations have unique solutions. In this paper we study complete iterativity for algebras with ...
SOFSEM
2005
Springer
14 years 1 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
DM
2008
13 years 7 months ago
2008
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primitively on the set of vertices. If F consists of Hamiltonian cycles, then F is the...
IJCGA
2006
13 years 7 months ago
2006
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
HYBRID
2010
Springer
13 years 5 months ago
2010
Springer
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...