Speeding-Up Construction Algorithms for the Graph Coloring Problem

Kazuho KANAHARA, Kengo KATAYAMA, Etsuji TOMITA

The graph coloring problem (GCP) is a fundamental combinatorial optimization problem that has many practical applications. Degree of SATURation (DSATUR) and Recursive Largest First (RLF) are well known as typical solution construction algorithms for GCP. It is necessary to update the vertex degree in the subgraph induced by uncolored vertices when selecting vertices to be colored in both DSATUR and RLF. There is an issue that the higher the edge density of a given graph, the longer the processing time. The purposes of this paper are to propose a degree updating method called Adaptive Degree Updating (ADU for short) that improves the issue and to evaluate the effectiveness of ADU for DSATUR and RLF on DIMACS benchmark graphs as well as random graphs having a wide range of sizes and densities. Experimental results show that the construction algorithms with ADU are faster than the conventional algorithms for many graphs and the ADU method yields significant speed-ups relative to the conventional algorithms, especially in the case of large graphs with higher edge density.

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences

E105-A

9

1241

1251