Sciweavers

483 search results - page 17 / 97
» On perfectness of sums of graphs
Sort
View
CC
2006
Springer
133views System Software» more  CC 2006»
13 years 8 months ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx
SIAMDM
2008
101views more  SIAMDM 2008»
13 years 8 months ago
Hamilton Cycles in Random Lifts of Directed Graphs
An n-lift of a digraph K, is a digraph with vertex set V (K)
Prasad Chebolu, Alan M. Frieze
ICC
2007
IEEE
14 years 3 months ago
MIMO Broadcast Channels with Channel Estimation
— We consider a multi-user MIMO downlink where the transmitter has only estimates of the channel while the receivers have perfect channel information. The impact of channel estim...
Jun Shi, Minnie Ho
TWC
2010
13 years 3 months ago
MIMO Broadcast Channels with Spatial Heterogeneity
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...
Illsoo Sohn, Jeffrey G. Andrews, Kwang Bok Lee
JGAA
2006
72views more  JGAA 2006»
13 years 8 months ago
A Multilevel Algorithm for the Minimum 2-sum Problem
In this paper we introduce a direct motivation for solving the minimum 2-sum problem, for which we present a linear-time algorithm inspired by the Algebraic Multigrid approach whi...
Ilya Safro, Dorit Ron, Achi Brandt