11160 search results - page 104 / 2232 » Incompleteness in a General Setting |
DM
2008
13 years 11 months ago
2008
It is proved that edges of a graph G with no component K2 can be coloured using at most 2 log2 (G) + 1 colours so that any two adjacent vertices have distinct sets of colours of t...
EOR
2010
13 years 11 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...
ICLP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
SIAMCOMP
1998
13 years 10 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
CIE
2005
Springer
14 years 4 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...