13 citations · 17 across the 3 of their papers we have counts for
1 paper · 1 filter
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
We first devise a branching algorithm that computes a minimum independent dominating set on any graph with running time O*(2^0.424n) and polynomial space. This improves the O*(2^0.…