7773 search results - page 221 / 1555 » On generalized Frame-Stewart numbers |
174
click to vote
DAM
2010
15 years 6 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
156
click to vote
JGT
2008
15 years 6 months ago
2008
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...
169
click to vote
AFRICACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Graphics processing units (GPU) are increasingly being used for general purpose computing. We present implementations of large integer modular exponentiation, the core of public-ke...
234
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
139
click to vote
DAGM
1995
Springer
15 years 10 months ago
1995
Springer
: This paper introduces the notion of primary image segmentation which serves as a well defined link between low- and high-level image analysis. A general algorithmic framework bas...