By Topic

Constructive Generation of 3COL Instances by Embedding Minimal Unsolvable Structures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Nagasawa, Y. ; Dept. of Comput. Sci., Takushoku Univ., Hachioji, Japan ; Mizuno, K. ; Sasaki, H. ; Miki, Y.
more authors

Graph colorability, COL, is a typical constraint satisfaction problem to which phase transition phenomena,PTs, are important in the computational complexity of combinatorial search algorithms. PTs are significant and subtle because, in the PT region, extraordinarily hard problem instances are found, which may require exponential-order computational time to solve. To clarify PT mechanism, many studies have been undertaken to produce very hard instances, many of which were based on generate-and-test approaches. We propose a rather systematic or constructive algorithm that repeats the embedding of 4-critical graphs to arbitrarily generate large extraordinarily hard 3-colorability instances. We demonstrated experimentally that the computational cost to solve our generated instances is of an exponential order of the number of vertices by using a few actual coloring algorithms.

Published in:

Knowledge and Systems Engineering, 2009. KSE '09. International Conference on

Date of Conference:

13-17 Oct. 2009