Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem

• Published in: 2013 IEEE 25th International Conference on Tools with Artificial Intelligence pp. 939 - 946
• Main Authors: Li, Chu-Min, Fang, Zhiwen, Xu, Ke
• Format: Conference Proceeding Journal Article
• Language: English
• Published: IEEE 01.01.2013
• Subjects: Algorithms; Arrays; Artificial intelligence; Benchmark testing; Cognition; Conferences; Expert systems; Heuristic algorithms; Incremental Upper Bound; MaxClique; MaxSAT; Partitioning algorithms; Reasoning; Remedies; Searching; Silicon; Trees; Upper bound; Upper bounds

Recently, MaxSAT reasoning has been shown to be powerful in computing upper bounds for the cardinality of a maximum clique of a graph. However, existing upper bounds based on MaxSAT reasoning have two drawbacks: (1)at every node of the search tree, MaxSAT reasoning has to be performed from scratch t...