7796 search results - page 15 / 1560 » On Generalized Schur Numbers |
158
click to vote
DAM
2008
15 years 6 months ago
2008
For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition nu...
148
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
This article is not a research paper, but a little note on the history of combinatorics: we present here a tentative short biography of Henri Delannoy, and a survey of his most no...
194
click to vote
CIE
2007
Springer
16 years 22 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
167
click to vote
KR
2000
Springer
15 years 10 months ago
2000
Springer
We present a new tableaux calculus deciding the ABox consistency problem for the expressive description logic ALCNHR+ . Prominent language features of ALCNHR+ are number restricti...
143
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...