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...
Tallennettuna:
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Artikkeli |
| Kieli: | venäjä |
| Julkaistu: |
Don State Technical University
2014-06-01
|
| Sarja: | Advanced Engineering Research |
| Aiheet: | |
| Linkit: | https://www.vestnik-donstu.ru/jour/article/view/322 |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|