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 experiments over random and benchmark instances.
A sequence of vertices in a graph G with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was not totally dominated by preceding vertices in the sequence, and, at the end all vertices of G are totally dominated (by definition a vertex totally dominates its neighbors). The maximum length of a total dominating sequence is called the Grundy total domination number, γ t gr (G), of G, as introduced in [B. Brešar, M. A. Henning, and D. F. Rall, Total dominating sequences in graphs, Discrete Math. 339 (2016), 1165-1676]. In this paper we continue the investigation of this concept, mainly from the algorithmic point of view. While it was known that the decision version of the problem is NP-complete in bipartite graphs, we show that this is also true if we restrict to split graphs. A linear time algorithm for determining the Grundy total domination number of an arbitrary tree T is presented, based on the formula γ t gr (T ) = 2τ (T ), where τ (T ) is the vertex cover number of T . A similar efficient algorithm is presented for bipartite distancehereditary graphs. Using the modular decomposition of a graph, we present a frame for obtaining polynomial algorithms for this problem in classes of graphs having relatively simple modular subgraphs. In particular, a linear algorithm for determining the Grundy total domination number of P4-tidy graphs is presented. In addition, we prove a realization result by exhibiting a family of graphs G k such that γ t gr (G k ) = k, for any k ∈ Z + \ {1, 3}, and showing that there are no graphs G with γ t gr (G) ∈ {1, 3}. We also present such a family, which has minimum possible order and size among all graphs with Grundy total domination number equal to k.
In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence that shows the efficacy of these inequalities used in a cutting-plane algorithm.
Abstract. The Equitable Coloring Problem is a variant of the GraphColoring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem, current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic methods. In this paper we present a tabu search heuristic for the Equitable Coloring Problem. This algorithm is an adaptation of the dynamic TabuCol version of Galinier and Hao. In order to satisfy equity constraints, new local search criteria are given. Computational experiments are carried out in order to find the best combination of parameters involved in the dynamic tenure of the heuristic. Finally, we show the good performance of our heuristic over known benchmark instances.
Working on the set covering polyhedron of consecutive ones circulant matrices, Argiroffo and Bianchi found a class of facet defining inequalities, induced by a particular family of circulant minors. In this work we extend these results to inequalities associated with every circulant minor. We also obtain polynomial separation algorithms for particular classes of such inequalities.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.