44 search results - page 1 / 9 » Backbone colorings of graphs with bounded degree |
DAM
2010
13 years 5 months ago
2010
PCI
2005
Springer
13 years 10 months ago
2005
Springer
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
ALGORITHMICA
2004
13 years 4 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
DM
2006
13 years 5 months ago
2006
In 1985, Erdos and Ne