ITM Web Conf.
Volume 7, 20163rd Annual International Conference on Information Technology and Applications (ITA 2016)
|Number of page(s)||5|
|Section||Session 1: Communication and Networking|
|Published online||21 November 2016|
Research on the Solution Space of 2-SAT and Max-2-SAT
Beihang University, Beijing, China
a e-mail: firstname.lastname@example.org
We study the properties of 2-SAT and Max-2-SAT problems by analyzing the node adding process on the factor graph. Two important structures, backbones and mutual-determinations are investigated, and the reduced solution graph for the expression of solution space of 2-SAT and Max-2-SAT is defined. For 2-SAT problem, a complete evolution process for the reduced graph is discussed and corresponding algorithm is obtained. For the Max-2-SAT problem, the analysis shows it’s backbone number can evolve in a much harder way by which it can increase or decrease. The research in this paper provide a new view point for understanding the solution space of 2-SAT and Max-2-SAT, which will be benefit for recognizing the complexity nature of the NP-hard problems.
© Owned by the authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.