Sciweavers

Share
8 search results - page 1 / 2
» Algorithmic Aspects of Acyclic Edge Colorings
Sort
View
ALGORITHMICA
2002
159views more  ALGORITHMICA 2002»
9 years 6 months ago
Algorithmic Aspects of Acyclic Edge Colorings
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...
Noga Alon, Ayal Zaks
SOFSEM
2007
Springer
10 years 1 months ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
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 ...
Markus Maier, Steffen Mecke, Dorothea Wagner
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
10 years 7 days ago
Convergent transfer subgraph characterization and computation
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...
Wing Ning Li
INFOCOM
2005
IEEE
10 years 17 days ago
Link scheduling in sensor networks: distributed edge coloring revisited
— 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 ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
IWOCA
2009
Springer
157views Algorithms» more  IWOCA 2009»
10 years 1 months ago
Forbidden Subgraph Colorings and the Oriented Chromatic Number
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
N. R. Aravind, C. R. Subramanian
books