Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
It is shown that there is an absolute constant c with the following property: For any two graphs G1 = (V, E1) and G2 = (V, E2) on the same set of vertices, where G1 has maximum degree at most d and G2 is a vertex disjoint union of cliques of size cd each, the chromatic number of the graph G = (V, E1 U E2) is precisely cd. The proof is based on probabilistic arguments. Copyright © 1992 Wiley Periodicals, Inc., A Wiley Company
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
D.S. Turaga, K. Ratakonda, et al.
SCC 2006