@unpublished{bourgeois:hal-01518581,
TITLE = {Average-case complexity of a branch-and-bound algorithm for max independent set under the G(n,p) random model},
AUTHOR = {Bourgeois, Nicolas and Catellier, R{\'e}mi and Denat, T and Paschos, Vangelis Th},
URL = {https://hal.science/hal-01518581},
NOTE = {working paper or preprint},
YEAR = {2017},
MONTH = May, KEYWORDS = {Complexity Theory ; Graphs},
HAL_ID = {hal-01518581},
HAL_VERSION = {v1},
}
Affichage BibTex