This paper describes an exact algorithm for the Equitable Coloring Problem, based on the well known DSatur algorithm for the classic Coloring Problem with new pruning rules specifically derived from the equity constraint. Computational experiences show that our algorithm is competitive with those known in literature.

Let G be an intuitionistic fuzzy graph. Let u and v be two vertices of G. A subset D of V is called a fuzzy equitable dominating set if every v ∈ V − Dthere exist a vertex u ∈ D such that uv ∈ E(G) and |deg(u) − deg(v)| = 1 where deg(u) denotes the degree of vertex u and deg(v) denotes the degree of vertex v and μ2(vi, vj ) = μ1(vi) ∧ μ1(vj ), γ2(vi, vj ) = γ1(vi) ∨ γ1(vj ). The minimum cardina...

Chen, Lih, and Wu conjectured that for r≥3, the only connected graphs with maximum degree at most r that are not equitably r-colorable are Kr,r (for odd r) and Kr+1. If true, this would be a strengthening of the Hajnal–Szemerédi Theorem and Brooks’ Theorem. We extend their conjecture to disconnected graphs. For r≥6 the conjecture says the following: If an r-colorable graph G with maximum degree...

The official handicapping system of the Royal Canadian Golf Association (RCGA) is very similar to the handicapping system of the United States Golf Association (USGA). Although these handicapping systems are complex and have been carefully studied, the systems do not take statistical theory into account. In 2000, the Handicap Research Committee of the RCGA was formed and challenged with the tas...

An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most 1. A d-degenerate graph is a graph G in which every subgraph has a vertex with degree at most d. A star Sm with m rays is an example of a 1-degenerate graph with maximum degree m that needs at least 1 + m/2 colors for an equitable coloring. Our main result is that every n-...

Location problems can be considered as multiple criteria models where for each client (spatial unit) there is de®ned an individual objective function, which measures the e€ect of a location pattern with respect to the client satisfaction (e.g., it expresses the distance or travel time between the client and the assigned facility). This results in a multiple criteria model taking into account th...

One of the major challenges facing humankind is to provide an equitable standard of living for this and future generations: adequate food, water and energy, safe shelter and a healthy environment (e.g., clean air and water). Unfortunately, human-induced climate change, as well as other global environmental issues such as land degradation, loss of biological diversity and stratospheric ozone dep...

One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate the class of matroids having the property that this procedure yields a basis uniformly at random. We show how this class is related to some other naturally-defined families of matroids and consider how it behaves under ...

The randomized k-paging algorithm Equitable given by Achlioptas et al. is Hk-competitive and uses O(k 2 log k) memory. This competitive ratio is best possible. The randomized algorithm RMark given by Fiat et al. is (2Hk − 1)-competitive, but only uses O(k) memory. Borodin and El Yaniv [6] list as an open question whether there exists an Hk-competitive randomized algorithm which requires O(k) me...

Humans tend to reduce inequitable distributions. Previous neuroimaging studies have shown that inequitable decisions are related to brain regions that associated with negative emotion and signaling conflict. In the highly complex human social environment, our opinions and behaviors can be affected by social information. In current study, we used a modified dictator game to investigate the effec...