Sciweavers

31 search results - page 2 / 7
» A Radio Coloring of a Hypercube
Sort
View
GC
2007
Springer
13 years 5 months ago
Rainbows in the Hypercube
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
Maria Axenovich, Heiko Harborth, Arnfried Kemnitz,...
PERCOM
2006
ACM
14 years 4 months ago
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
Christopher L. Barrett, V. S. Anil Kumar, Madhav V...
SPAA
2005
ACM
13 years 10 months ago
Coloring unstructured radio networks
Thomas Moscibroda, Roger Wattenhofer
INFOCOM
1999
IEEE
13 years 9 months ago
Hop Reservation Multiple Access (HRMA) for Ad-Hoc Networks
A new multichannel MAC protocol called Hop-Reservation Multiple Access (HRMA) for wireless ad-hoc networks (multi-hop packet radio networks) is introduced, specified and analyzed. ...
Zhenyu Tang, J. J. Garcia-Luna-Aceves
SIAMDM
2008
99views more  SIAMDM 2008»
13 years 5 months ago
Hat Guessing Games
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking a...
Steve Butler, Mohammad Taghi Hajiaghayi, Robert D....