Article PDF
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
The online version of the original article can be found under doi:10.1007/s10898-006-9039-7.
Rights and permissions
About this article
Cite this article
Tomita, E., Kameda, T. An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J Glob Optim 44, 311 (2009). https://doi.org/10.1007/s10898-008-9362-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-008-9362-2