We study routing and path coloring problems in all-optical networks as non-cooperative games. We especially focus on oblivious payment functions, that is, functions that charge a player according to her own strategy only. We first strengthen a known relation between such games and online routing and path coloring. In particular, we show that the price of anarchy of such games is lower-bounded b...

We present a branching scheme for some Vertex Coloring Problems based on a new graph operator called extension. The extension operator is used to generalize the branching scheme proposed by Zykov for the basic problem to a broad class of coloring problems, such as the graph multicoloring, where each vertex requires a multiplicity of colors, the graph bandwidth coloring, where the colors assigne...

application of ethephon is an effective way in increase of grape fruits quality. in this study the effect of preharvest application of ethephon solution at four levels (0, 150, 250 and 300 mg/l)and application time at two levels (10-20% and 50-70% of berry coloring), were evaluated on quality indices of ghizil uzum grape cultivar at harvest time. evaluated indices were soluble solids content, t...

This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem where the sizes of two arbitrary color classes differ in at most one unit. Based on the well known DSatur algorithm for the classic Coloring Problem, a pruning criterion arising from equity constraints is proposed and analyzed. The good performance of the algorithm is shown through computational ex...

a modular $k$-coloring, $kge 2,$ of a graph $g$ without isolated vertices is a coloring of the vertices of $g$ with the elements in $mathbb{z}_k$ having the property that for every two adjacent vertices of $g,$ the sums of the colors of the neighbors are different in $mathbb{z}_k.$ the minimum $k$ for which $g$ has a modular $k-$coloring is the modular chromatic number of $g.$ except for some s...

This paper proposes a new method based on the cultural algorithm to solve graph coloring problem (GCP). Graph coloring problem involves finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. In this paper various components of cultural algorithm have been implemented to solve GCP with a self adaptive behavior in an efficient manner...

This paper proposes a new method based on the cultural algorithm to solve graph coloring problem (GCP). Graph coloring problem involves finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. In this paper various components of cultural algorithm have been implemented to solve GCP with a self adaptive behavior in an efficient manner...

A V-coloring of a graph G is a coloring of the nodes of G with V colors in such a way any two neighboring nodes have different colors. We prove that there exists a O(∆ log n) time distributed algorithm computing a O(∆)-coloring for unit disc graphs under the signal-tointerference-plus-noise ratio (SINR)-based physical model (∆ is the maximum degree of the graph). We also show that, for a well d...