Advertisement

Journal of Global Optimization

, Volume 44, Issue 2, pp 311–311 | Cite as

An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments

  • Etsuji Tomita
  • Toshikatsu Kameda
Erratum

Copyright information

© Springer Science+Business Media, LLC. 2008

Authors and Affiliations

  1. 1.Department of Information and Communication EngineeringThe University of Electro-CommunicationsTokyoJapan

Personalised recommendations