%0 Conference Paper %1 conf/cp/McCreeshP14 %A McCreesh, Ciaran %A Prosser, Patrick %B CP %D 2014 %E O'Sullivan, Barry %I Springer %K dblp %P 549-563 %T Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem. %U http://dblp.uni-trier.de/db/conf/cp/cp2014.html#McCreeshP14 %V 8656 %@ 978-3-319-10427-0

@inproceedings{conf/cp/McCreeshP14, added-at = {2017-05-17T00:00:00.000+0200}, author = {McCreesh, Ciaran and Prosser, Patrick}, biburl = {https://www.bibsonomy.org/bibtex/21659d6156bac848013884aee7d3881b1/dblp}, booktitle = {CP}, crossref = {conf/cp/2014}, editor = {O'Sullivan, Barry}, ee = {https://doi.org/10.1007/978-3-319-10428-7_40}, interhash = {01c0da885fe72bbc2224d490f32aead3}, intrahash = {1659d6156bac848013884aee7d3881b1}, isbn = {978-3-319-10427-0}, keywords = {dblp}, pages = {549-563}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T15:20:02.000+0200}, title = {Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem.}, url = {http://dblp.uni-trier.de/db/conf/cp/cp2014.html#McCreeshP14}, volume = 8656, year = 2014 }