Sciweavers

263 search results - page 9 / 53
» Minimum Entropy Coloring
Sort
View
IJCM
2002
83views more  IJCM 2002»
14 years 11 months ago
A Radio Coloring of a Hypercube
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pai...
Ophir Frieder, Frank Harary, Peng-Jun Wan
DAM
2011
14 years 6 months ago
Minimum sum set coloring of trees and line graphs of trees
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
Flavia Bonomo, Guillermo Durán, Javier Mare...
FAW
2010
Springer
225views Algorithms» more  FAW 2010»
15 years 10 hour ago
Computing Minimum Diameter Color-Spanning Sets
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
Rudolf Fleischer, Xiaoming Xu
TIT
2010
121views Education» more  TIT 2010»
14 years 6 months ago
Mismatched estimation and relative entropy
A random variable with distribution P is observed in Gaussian noise and is estimated by a minimum meansquare estimator that assumes that the distribution is Q. This paper shows tha...
Sergio Verdú
AAIM
2007
Springer
127views Algorithms» more  AAIM 2007»
15 years 6 months ago
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas