TY  - JOUR
AU  - Al-Omari, Hussein 
AU  - Sabri, Khair E. 
PY  - 2007
TI  - New Graph Coloring Algorithms
JF  - Journal of Mathematics and Statistics
VL  - 2
IS  - 4
DO  - 10.3844/jmssp.2006.439.441
UR  - https://thescipub.com/abstract/jmssp.2006.439.441
AB  - 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.