COMPARATIVE ANALYSIS OF COLORING ALGORITHMS FOR ORDINARY WEIGHTED GRAPH

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Andrey Sergeyevich Merzlenko, Valery Grigoryevich Kobak
Format: Article
Language:Russian
Published: Don State Technical University 2014-06-01
Series:Advanced Engineering Research
Subjects:
weighted graphs, weighted graph coloring, scheduling theory.
Online Access:https://www.vestnik-donstu.ru/jour/article/view/322
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items