COMPARATIVE ANALYSIS OF COLORING ALGORITHMS FOR ORDINARY WEIGHTED GRAPH
Algorithms of solving the “minimax” weighted graph coloring problem are considered and compared. The mathematical formulation of the problem is presented; the solution optimality criteria are stated. The exact algorithm that always finds the minimum count of colors through Maghout method and then fi...
| Glavni autori: | , |
|---|---|
| Format: | Članak |
| Jezik: | Russian |
| Izdano: |
Don State Technical University
2014-06-01
|
| Serija: | Advanced Engineering Research |
| Teme: | |
| Online pristup: | https://www.vestnik-donstu.ru/jour/article/view/322 |