3757 search results - page 26 / 752 » The overlap number of a graph |
IJCAI
2003
13 years 9 months ago
2003
This paper presents a new measure of semantic relatedness between concepts that is based on the number of shared words (overlaps) in their definitions (glosses). This measure is ...
SIAMDM
2008
13 years 8 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
JGT
2006
13 years 8 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
RSA
2002
13 years 8 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
EJWCN
2011
13 years 3 months ago
2011
— Multicast and broadcast service (MBS) is one of the important services for next generation wireless systems. In WiMAX, the radio resource unit (i.e., time, frequency, code, etc...