Abstract
Recently, MaxSAT reasoning is shown very effective in computing a tight upper bound for a Maximum Clique (MC) of a (unweighted) graph. In this paper, we apply MaxSAT reasoning to compute a tight up...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have