TY - JFULL
AU - Jeffrey L. Duffany
PY - 2010/4/
TI - Complexity Analysis of Some Known Graph Coloring Instances
T2 - International Journal of Electrical and Computer Engineering
SP - 391
EP - 398
VL - 4
SN - 1307-6892
UR - https://publications.waset.org/pdf/10062
PU - World Academy of Science, Engineering and Technology
NX - Open Science Index 39, 2010
N2 - Graph coloring is an important problem in computer
science and many algorithms are known for obtaining reasonably
good solutions in polynomial time. One method of comparing
different algorithms is to test them on a set of standard graphs where
the optimal solution is already known. This investigation analyzes a
set of 50 well known graph coloring instances according to a set of
complexity measures. These instances come from a variety of
sources some representing actual applications of graph coloring
(register allocation) and others (mycieleski and leighton graphs) that
are theoretically designed to be difficult to solve. The size of the
graphs ranged from ranged from a low of 11 variables to a high of
864 variables. The method used to solve the coloring problem was
the square of the adjacency (i.e., correlation) matrix. The results
show that the most difficult graphs to solve were the leighton and the
queen graphs. Complexity measures such as density, mobility,
deviation from uniform color class size and number of block
diagonal zeros are calculated for each graph. The results showed that
the most difficult problems have low mobility (in the range of .2-.5)
and relatively little deviation from uniform color class size.
ER -