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 ...
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...
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...
: 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...
— 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...