Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: polynomial heuristics

Sortuj według:

Ogranicz wyniki do:

Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms

Furmańczyk H., Jastrzębski A., Kubale M.

Archives of Control Sciences

2016

Vol. 26, no. 3

281--295

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.