Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Average-case complexity of a branch-and-bound algorithm for max independent set under the G(n,p) random model

Abstract : We study average-case complexity of branch-and-bound for max independent set in random graphs under the G(n, p) distribution. In this model every pair (u, v) of vertices belongs to E with probability p independently on the existence of any other edge. We make a precise case analysis, providing phase transitions between subexponential and exponential complexities depending on the probability p of the random model.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01518581
Contributor : Nicolas Bourgeois Connect in order to contact the contributor
Submitted on : Friday, May 5, 2017 - 9:05:51 AM
Last modification on : Thursday, January 20, 2022 - 9:02:01 AM

Links full text

Identifiers

  • HAL Id : hal-01518581, version 1
  • ARXIV : 1505.04969

Citation

Nicolas Bourgeois, Rémi Catellier, T Denat, Vangelis Paschos. Average-case complexity of a branch-and-bound algorithm for max independent set under the G(n,p) random model. 2017. ⟨hal-01518581⟩

Share

Metrics

Les métriques sont temporairement indisponibles