3204 search results - page 221 / 641 » The b-chromatic Number of a Graph |
122
Voted
PPOPP
2006
ACM
15 years 6 months ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
104
Voted
EJC
2008
15 years 22 days ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
CPC
1998
15 years 10 days ago
1998
We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the ...
95
Voted
DCC
2008
IEEE
16 years 7 days ago
2008
IEEE
Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than pe (q -1) directio...
117
Voted
AGTIVE
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we describe the Ludo case, one of the case studies of the AGTIVE 2007 Tool Contest (see [22]). After summarising the case description, we give an overview of the subm...