Graph coloring was exploited in wireless sensor networks to solve many optimization problems. These problems are related in general to channel assignment. In this paper, we propose to jointly use coloring for routing purposes. We introduce CHRA a coloring based hierarchical routing approach. Coloring is exploited to avoid interferences and also to schedule nodes transmissions to sink. We provid...

The list coloring problem is a variant of vertex coloring where a vertex may be colored only a color from a prescribed set. Several applications of vertex coloring are more appropriately modelled as instances of list coloring and thus we argue that it is an important problem to consider. Regardless of the importance of list coloring, few published algorithms exist for it. In this paper we revie...

Batch scheduling of conflicting jobs is modeled by batch coloring of a graph. Given an undirected graph and the number of colors required by each vertex, we need to find a proper batch coloring of the graph, i.e., partition the vertices to batches which are independent sets, and to assign to each batch a contiguous set of colors, whose size equals to the maximum color requirement of any vertex ...

In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its neighborhood. The conflict-free coloring problem is to color the vertices of a graph using the minimum number of colors such that the coloring is conflict-free. We consider both closed neighborhoods, where the neighbor...

Efficiently coloring an arbitrary graph is a fundamental and notoriously difficult algorithmic problem. This talk focuses on the restricted problem of determining the complexity of coloring graphs which do not contain a certain induced subgraph. Combining results of Kamiński and Lozin, and Hoyler, it follows that this problem remains NP-complete unless the excluded induced subgraph is a disjoin...

The graph coloring problem is a notoriously hard problem, for which we do not have efficient algorithms. A coloring of a graph is an assignment of colors to its vertices such that the end points of every edge have different colors. A k-coloring is a coloring that uses at most k distinct colors. The graph coloring problem is to find a coloring that uses the minimum number of colors. Given a 3-co...

The federal government requires those who destroy wetlands to preserve, restore, or create new ones with the goal of no net loss of wetlands. In the summer of 2000, we tested whether forested wetlands created an average of 8 years earlier had developed avian communities similar to natural wetlands of the same age in southeastern Virginia. We compared six created wetlands to five natural (refere...

Intensive pine (Pinus spp.) management is a primary land use in the southeastern United States. In eastern North Carolina, intensively managed pine stands often occur on land previously ditched and drained. Because modification of natural vegetation and water sources are known to affect dipteran community structure, we studied effects of intensive pine management on abundance and diversity of d...

This work proposes an efficient method for solving the Distance-1 Edge Coloring problem (D1EC) for the assignment of orthogonal channels in wireless networks with changing topology. The coloring algorithm is performed by means of the simulated annealing method, a generalization of Monte Carlo methods for solving combinatorial problems. We show that the simulated annealing-based coloring converg...

A graph edge is d-coloring redundant if the removal of the edge does not change the set of dcolorings of the graph. Graphs that are too sparse or too dense do not have coloring redundant edges. Tight upper and lower bounds on the number of edges in a graph in order for the graph to have a coloring redundant edge are proven. Two constructions link the class of graphs with a coloring redundant ed...