N. Bourgeois

activity

20092015

most citedFast algorithms for min independent dominating set

13 citations · 17 across the 3 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2015★ 2 cited

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

N. Bourgeois, R. Catellier, T. Denat +1

We study average-case complexity of branch-and-bound for maximum independent set in random graphs under the $G (n, p)$ distribution. In this model every pair $(u, v)$ of ver…

cs.CC2013★ 2 cited

Playing with parameters: structural parameterization in graphs

Nicolas Bourgeois, Konrad K. Dabrowski, Marc Demange +1

When considering a graph problem from a parameterized point of view, the parameter chosen is often the size of an optimal solution of this problem (the "standard" parameter). A nat…

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

Playing with parameters: structural parameterization in graphs

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