@unpublished{bourgeois:hal-01258958,
TITLE = {Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model},
AUTHOR = {Bourgeois, Nicolas and Catellier, R{\'e}mi and Denat, T. and Paschos, V. Th.},
URL = {https://hal.science/hal-01258958},
NOTE = {working paper or preprint},
YEAR = {2015},
HAL_ID = {hal-01258958},
HAL_VERSION = {v1},
}