2310 search results - page 118 / 462 » Coloring Random Graphs |
134
click to vote
SIAMJO
2008
15 years 2 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
117
click to vote
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
153
Voted
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
Usually changes in remote sensing images go along with the appearance or disappearance of some edges. In addition, pixels located along the edges are likely to weakly influenced b...
99
Voted
ESA
2004
Springer
15 years 7 months ago
2004
Springer
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
153
Voted
DM
2002
15 years 2 months ago
2002
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...