18209 search results - page 362 / 3642 » Some Remarks on the Paper |
153
Voted
CROSSROADS
2008
15 years 7 months ago
2008
This paper attempts to raise some issues that are important for graduate students to be successful and to get as much out of the process as possible, and for advisors who wish to ...
175
click to vote
DM
2010
15 years 7 months ago
2010
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm...
152
click to vote
EJC
2010
15 years 6 months ago
2010
The objective of this paper is to study a special family of Minkowski sums, that is of polytopes relatively in general position. We show that the maximum number of faces in the su...
189
click to vote
DM
2008
15 years 6 months ago
2008
In this paper, the total chromatic number and fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional ...
164
Voted
ALMOB
2006
15 years 6 months ago
2006
Recently, we performed an assessment of 13 popular computational tools for discovery of transcription factor binding sites (M. Tompa, N. Li, et al., "Assessing Computational ...