3757 search results - page 33 / 752 » The overlap number of a graph |
GLOBECOM
2009
IEEE
14 years 3 months ago
2009
IEEE
— Existing channel assignment algorithms designed for multi-radio multi-channel wireless mesh networks (MRMC-WMN) mainly deal with orthogonal or nonoverlapped channels. But in re...
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...
TSP
2010
13 years 3 months ago
2010
The objective of this paper is twofold. The first part provides further insight in the statistical properties of the Welch power spectrum estimator. A major drawback of the Welch m...
DM
2010
13 years 8 months ago
2010
A card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjecture states that each graph with at least three vertices is determined by its multiset of...
JGT
2007
13 years 8 months ago
2007
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...