A branch-and-bound procedure for the largest clique in a graph

Authors
Barnes, ER
Citation
Er. Barnes, A branch-and-bound procedure for the largest clique in a graph, NONC OPTIM, 42, 2000, pp. 63-77
Categorie Soggetti
Current Book Contents","Current Book Contents
Journal title
APPROXIMATION AND COMPLEXITY IN NUMERICAL OPTIMIZATION : CONTINUOUS AND DISCRETE PROBLEMS → ACNP
Volume
42
Year of publication
2000
Pages
63 - 77
Database
ISI
SICI code