Equitable coloring of graphs. Recent theoretical results and new practical algorithms
In this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.
Hanna Furmańczyk, Andrzej Jastrzębski, Marek Kubale. (2016). Equitable coloring of graphs. Recent theoretical results and new practical algorithms, 26(3), 281-295.
wyświetlono 21 razy