2981 search results - page 321 / 597 » Word Sense and Subjectivity |
139
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
181
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking a...
216
click to vote
SIAMDM
2008
15 years 6 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
166
click to vote
SIAMDM
2008
15 years 6 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
164
click to vote
SIAMDM
2008
15 years 6 months ago
2008
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...