26 search results - page 6 / 6 » Size of monochromatic components in local edge colorings |
ICALP
2001
Springer
13 years 10 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...