Wednesday, 15:45 - 16:10 h, Room: H 3005


Marcin Jurkiewicz
Colorings of the strong product of graphs


Graph coloring is one of the famous problems in graph theory and it has many applications. We present algorithms for coloring strong product of graphs. We also show their applications to bounding the Witsenhausen's rate. The rate is strongly related to the chromatic number of some graph products and it measures the smallest number of possible messages the informant must transmit in the zero-error source coding problem with side-information.


Talk 2 of the contributed session Wed.3.H 3005
"Graph coloring" [...]
Cluster 2
"Combinatorial optimization" [...]


  Payday Loans In Ohio. You can buy Levitra Super Force profitably on our web-site; we offer the medications only of the highest quality and at reasonable prices.