Sciweavers

66 search results - page 2 / 14
» Graph Coloring using Peer-to-Peer Networks
Sort
View
PDPTA
2003
13 years 6 months ago
A Design for Node Coloring and 1-Fair Alternator on de Bruijn Networks
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
Jyh-Wen Mao, Chang-Biau Yang
PODC
2009
ACM
14 years 5 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
ICC
2007
IEEE
101views Communications» more  ICC 2007»
13 years 11 months ago
Transmission Scheduling in Sensor Networks via Directed Edge Coloring
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...
Maggie X. Cheng, Li Yin
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
13 years 10 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia