1511 search results - page 42 / 303 » Randomness, lowness and degrees |
158
click to vote
COMSUR
2011
13 years 11 months ago
2011
Abstract—The computational and memory resources of wireless sensor nodes are typically very limited, as the employed low-energy microcontrollers provide only hardware support for...
APAL
2010
14 years 12 months ago
2010
A real x is 1 1-Kurtz random (1 1-Kurtz random) if it is in no closed null 1 1 set (1 1 set). We show that there is a cone of 1 1-Kurtz random hyperdegrees. We characterize lowness...
104
click to vote
WCNC
2010
IEEE
15 years 3 months ago
2010
IEEE
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
DM
2008
14 years 12 months ago
2008
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...
DM
2007
14 years 11 months ago
2007
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...