374 search results - page 13 / 75 » sum 2010 |
DM
2010
13 years 10 months ago
2010
An edge-magic total labelling (EMTL) of a graph G with n vertices and e edges is an injection : V (G)E(G) [n+e], where, for every edge uv E(G), we have wt(uv) = k, the magic sum...
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
This is a supplementary document for explaining what we could not contain in the main paper. I. BASIC FUNCTIONS AND NOTATIONS In this section, we first define some useful functi...
TWC
2010
13 years 4 months ago
2010
We develop a realistic model for multiple-input multiple-output (MIMO) broadcast channels, where each randomly located user's average SNR depends on its distance from the tran...
JGT
2010
13 years 8 months ago
2010
An antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, . . . , m} such that all n vertex sums are...
WAOA
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...