3211 search results - page 220 / 643 » On the Grundy Number of a Graph |
152
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...
181
click to vote
DM
2008
15 years 6 months ago
2008
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
179
click to vote
ESA
2005
Springer
15 years 12 months ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
183
click to vote
JCO
2007
15 years 6 months ago
2007
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...
191
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
We present a factor graph based design of a receiver for pilotassisted OFDM-IDMA systems transmitting over frequency-selective channels. The receiver performs joint iterative mult...