Sciweavers

7796 search results - page 15 / 1560
» On Generalized Schur Numbers
Sort
View
DAM
2008
85views more  DAM 2008»
13 years 10 months ago
The competition numbers of complete tripartite graphs
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...
Suh-Ryung Kim, Yoshio Sano
CORR
2004
Springer
106views Education» more  CORR 2004»
13 years 9 months ago
Why Delannoy numbers?
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...
Cyril Banderier, Sylviane R. Schwer
CIE
2007
Springer
14 years 4 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
KR
2000
Springer
14 years 1 months ago
Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles
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...
Volker Haarslev, Ralf Möller
ESA
2008
Springer
127views Algorithms» more  ESA 2008»
13 years 11 months ago
The Alcuin Number of a Graph
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...
Péter Csorba, Cor A. J. Hurkens, Gerhard J....