10 search results - page 2 / 2 » Almost all graphs with average degree 4 are 3-colorable |
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
WAOA
2005
Springer
13 years 10 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
FOCS
1989
IEEE
13 years 9 months ago
1989
IEEE
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...