By Topic

Constructive Generation of 3-COL Instances Focusing on Vertex Connectivity of 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

4 Author(s)
Nagasawa, Y. ; Dept. of Comput. Sci., Takushoku Univ., Tokyo, Japan ; Mizuno, K. ; Sasaki, H. ; Nishihara, S.

Phase transition phenomena observed in most combinatorial search problems including constraint satisfaction problems (CSPs) are important for clarifying how structures make problem instances hard to solve. For the graph 3-colorability (3COL), which is one of the typical CSPs, the method to systematically generate hard problem instances by embedding original minimal unsolvable structures has been proposed, whereas many research reports are based on random generate-and-test approaches. In this paper, we extend the systematic method, enabling to generate a hard 3COL instances with a higher-order connectivity. We demonstrate that the computational cost to solve 3COL instances generated by our method is of an exponential order of the number of vertices by using a few coloring algorithms and constraint satisfaction algorithms.

Published in:

Knowledge and Systems Engineering (KSE), 2010 Second International Conference on

Date of Conference:

7-9 Oct. 2010