New Graph Coloring Algorithms | Science Publications

Journal of Mathematics and Statistics

New Graph Coloring Algorithms

Hussein A. Omari and Khair E. Sabri

DOI : 10.3844/jmssp.2006.439.441

Journal of Mathematics and Statistics

Volume 2, Issue 4

Pages 439-441


Two new heuristic graph-coloring algorithms, based on known heuristic algorithms, have been introduced. One of them is a modification of the Largest Degree Ordering (LDO) algorithm, and the other one is a modification of the Saturation Degree Ordering (SDO) algorithm. The two new algorithms proposed in this paper, were compared empirically, in terms of used colors, with some of the known heuristic graph-coloring algorithms such as: Largest Degree Ordering (LDO), First Fit (FF), Saturated Degree Ordering (SDO), and Incident Degree Ordering (IDO). As a result of this comparison, it was found that the proposed algorithms were better than the original ones with respect to the number of used colors.


© 2006 Hussein A. Omari and Khair E. Sabri. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.