10997 search results - page 72 / 2200 » On the Structure of Complete Sets |
169
click to vote
CALCO
2009
Springer
16 years 12 days 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 ...
174
click to vote
SOFSEM
2005
Springer
15 years 11 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...
148
Voted
DM
2008
15 years 5 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...
150
click to vote
IJCGA
2006
15 years 5 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...
192
click to vote
FOIKS
2008
Springer
15 years 7 months ago
2008
Springer
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...