Minimum sum coloring problem: Upper bounds for the chromatic strength
暂无分享,去创建一个
[1] John Mitchem,et al. On the cost-chromatic number of graphs , 1997, Discret. Math..
[2] Flavia Bonomo,et al. On the Minimum Sum Coloring of P4-Sparse Graphs , 2014, Graphs Comb..
[3] Paolo Toth,et al. An exact approach for the Vertex Coloring Problem , 2011, Discret. Optim..
[4] Hossein Hajiabolhassan,et al. Minimal coloring and strength of graphs , 2000, Discret. Math..
[5] Flavia Bonomo,et al. Minimum Sum Coloring of P4-sparse graphs , 2009, Electron. Notes Discret. Math..
[6] Jin-Kao Hao,et al. Algorithms for the minimum sum coloring problem: a review , 2015, Artificial Intelligence Review.
[7] Jin-Kao Hao,et al. Hybrid evolutionary search for the minimum sum coloring problem of graphs , 2016, Inf. Sci..
[8] Guy Kortsarz,et al. Multicoloring: Problems and Techniques , 2004, MFCS.
[9] Aziz Moukrim,et al. Greedy Algorithms for the Minimum Sum Coloring Problem , 2009 .
[10] Jin-Kao Hao,et al. A Study of Breakout Local Search for the Minimum Sum Coloring Problem , 2012, SEAL.
[11] Chu Min Li,et al. Exact methods for the minimum sum coloring problem , 2015 .
[12] Klaus Jansen,et al. The Optimum Cost Chromatic Partition Problem , 1997, CIAC.
[13] Chu Min Li,et al. New Lower Bound for the Minimum Sum Coloring Problem , 2017, AAAI.
[14] Federico Malucelli,et al. Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation , 2012, INFORMS J. Comput..
[15] Y. Li,et al. Lower Bounds for the Minimal Sum Coloring Problem , 2010, Electron. Notes Discret. Math..
[16] Guy Kortsarz,et al. Minimum Color Sum of Bipartite Graphs , 1998, J. Algorithms.
[17] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[18] Jin-Kao Hao,et al. A memetic algorithm for the Minimum Sum Coloring Problem , 2013, Comput. Oper. Res..
[19] G. Hardy,et al. Asymptotic Formulaæ in Combinatory Analysis , 1918 .
[20] Mohammad R. Salavatipour,et al. On Sum Coloring of Graphs , 2003, Discret. Appl. Math..
[21] Klaus Jansen,et al. Approximation Results for the Optimum Cost Chromatic Partition Problem , 1997, J. Algorithms.
[22] Paul Erdös,et al. Tight bounds on the chromatic sum of a connected graph , 1989, J. Graph Theory.
[23] Mihir Bellare,et al. On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..
[24] Guy Kortsarz,et al. Minimizing Average Completion of Dedicated Tasks and Interval Graphs , 2001, RANDOM-APPROX.
[25] Leo G. Kroon,et al. The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs , 1996, WG.
[26] Ewa Kubicka,et al. An introduction to chromatic sums , 1989, CSC '89.
[27] Ke Xu,et al. Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem , 2013, ICTAI.
[28] Sara Nicoloso,et al. Sum coloring and interval graphs: a tight upper bound for the minimum number of colors , 2004, Discret. Math..
[29] Arunabha Sen,et al. On a Graph Partition Problem with Application to VLSI Layout , 1992, Inf. Process. Lett..