8 search results - page 1 / 2 » Algorithmic Aspects of Acyclic Edge Colorings |
ALGORITHMICA
2002
13 years 4 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
SOFSEM
2007
Springer
13 years 10 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
ISCAS
2003
IEEE
13 years 9 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
INFOCOM
2005
IEEE
13 years 10 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 ...
ICRA
2003
IEEE
13 years 9 months ago
2003
IEEE
— One of the most difficult aspects of dealing with illumination effects in computer vision is accounting for specularity in the images of real objects. The specular regions in ...