Open AccessAn Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem
Author(s) -
Chu-Min Li,
Zhe Quan
Publication year - 2010
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v24i1.7536
Subject(s) - maximum satisfiability problem , clique problem , upper and lower bounds , clique graph , partition (number theory) , combinatorics , branch and bound , clique , mathematics , induced subgraph isomorphism problem , graph , random graph , algorithm , discrete mathematics , computer science , line graph , pathwidth , boolean function , graph power , mathematical analysis , voltage graph
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom