首页 | 本学科首页   官方微博 | 高级检索  
     


An exact DSatur-based algorithm for the Equitable Coloring Problem
Affiliation:1. FCEyN, Universidad de Buenos Aires, Argentina;2. FCEIA, Universidad Nacional de Rosario y CONICET Argentina;1. Instituto de Informática, Universidade Federal de Goiás, Brazil;2. Institut für Optimierung und Operations Research, Universität Ulm, Germany;3. PESC, COPPE, Universidade Federal do Rio de Janeiro, Brazil;4. Inst Mat., COPPE and NCE, Universidade Federal do Rio de Janeiro, Brazil;1. Universidad Nacional de Rosario, Argentina;2. CONICET and Universidad Nacional de Rosario, Argentina
Abstract: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.
Keywords:equitable coloring  DSatur  exact algorithm
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号