1302 search results - page 34 / 261 » On the Strong Chromatic Number |
138
click to vote
CPC
2007
15 years 6 months ago
2007
The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner’s Theorem, the strong isomet...
128
click to vote
FMCAD
2000
Springer
15 years 9 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
156
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
The presence of highlights, which in dielectric inhomogeneous objects are linear combination of specular and diffuse reflection components, is inevitable. A number of methods have...
165
click to vote
JCT
2000
15 years 6 months ago
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
137
click to vote
ICA
2004
Springer
15 years 11 months ago
2004
Springer
A series of recent results shows that if a signal admits a sufficiently sparse representation (in terms of the number of nonzero coefficients) in an “incoherent” dictionary, th...