18 search results - page 2 / 4 » Strong edge-coloring of graphs with maximum degree 4 using 2... |
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
INFOCOM
2005
IEEE
13 years 11 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
ESA
2006
Springer
13 years 9 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...