3211 search results - page 221 / 643 » On the Grundy Number of a Graph |
141
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
155
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider a pilot-assisted interleave-division multiple access (IDMA) system transmitting over block-fading channels. We describe this system in terms of a factor graph and use ...
160
click to vote
WONS
2005
IEEE
16 years 3 days ago
2005
IEEE
At present, no standard frequency allocation mechanism exists for Wireless LAN access points. In this article, we introduce a number of techniques based on graph colouring algorit...
189
click to vote
ESA
2005
Springer
16 years 2 days ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
183
click to vote
IPTPS
2004
Springer
15 years 12 months ago
2004
Springer
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...