Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/aaai/LiQ10
%A Li, Chu Min
%A Quan, Zhe
%B AAAI
%D 2010
%E Fox, Maria
%E Poole, David
%I AAAI Press
%K dblp
%P 128-133
%T An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem.
%U http://dblp.uni-trier.de/db/conf/aaai/aaai2010.html#LiQ10
@inproceedings{conf/aaai/LiQ10,
added-at = {2023-09-04T00:00:00.000+0200},
author = {Li, Chu Min and Quan, Zhe},
biburl = {https://www.bibsonomy.org/bibtex/2ad9bf094401794b2d54799f8d5005b02/dblp},
booktitle = {AAAI},
crossref = {conf/aaai/2010},
editor = {Fox, Maria and Poole, David},
ee = {https://doi.org/10.1609/aaai.v24i1.7536},
interhash = {6662b2aff3d34ad6eb9c7b1b498e8228},
intrahash = {ad9bf094401794b2d54799f8d5005b02},
keywords = {dblp},
pages = {128-133},
publisher = {AAAI Press},
timestamp = {2024-04-09T18:15:06.000+0200},
title = {An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem.},
url = {http://dblp.uni-trier.de/db/conf/aaai/aaai2010.html#LiQ10},
year = 2010
}
