- Tytuł:
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
- Autorzy:
-
Furmańczyk, H.
Jastrzębski, A.
Kubale, M. - Powiązania:
- https://bibliotekanauki.pl/articles/230069.pdf
- Data publikacji:
- 2016
- Wydawca:
- Polska Akademia Nauk. Czytelnia Czasopism PAN
- Tematy:
-
computer experiments
corona graph
equitable chromatic number
equitable coloring conjectures
NP-hardness
polynomial heuristics - Opis:
- In many applications in sequencing and scheduling it is desirable to have an underlaying graph as equitably colored as possible. 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.
- Źródło:
-
Archives of Control Sciences; 2016, 26, 3; 281-295
1230-2384 - Pojawia się w:
- Archives of Control Sciences
- Dostawca treści:
- Biblioteka Nauki
Artykuł