Author:
San Segundo Pablo,Artieda Jorge
Publisher
Springer Science and Business Media LLC
Reference47 articles.
1. Ballard DH, Brown M (1982) Computer vision. Prentice-Hall, New York
2. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds), New York, pp 85–103
3. Tomita E, Seki T (2003) An efficient branch and bound algorithm for finding a maximum clique. In: Calude C, Dinneen M, Vajnovszki V (eds) Discrete mathematics and theoretical computer science, vol 2731. LNCS, pp 278–289
4. Tomita E, Sutani Y, Higashi T, Takahashi S, Wakatsuki M (2010) A simple and faster branch-and-bound algorithm for finding a maximum clique. Lect Notes Comput Sci 5942:191– 203
5. Konc J, Janečič D (2007) An improved branch and bound algorithm for the maximum clique problem. MATCH Commun Math Comput Chem 58:569–590
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献