3757 search results - page 66 / 752 » The overlap number of a graph |
DM
2008
14 years 10 months ago
2008
In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any ...
TKDE
2008
14 years 9 months ago
2008
In this paper, we present an agglomerative fuzzy K-Means clustering algorithm for numerical data, an extension to the standard fuzzy K-Means algorithm by introducing a penalty term...
APPML
2008
14 years 10 months ago
2008
The following fundamental result for the domination number (G) of a graph G was proved by Alon and Spencer, Arnautov, Lov
MST
2006
14 years 9 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
109
click to vote
IWPEC
2004
Springer
15 years 3 months ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...