Algorithms parameterized by vertex cover and modular width, through potential maximal cliques

Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre +1

In this paper we give upper bounds on the number of minimal separators and potential maximal cliques of graphs w.r.t. two graph parameters, namely vertex cover ($\mathrm{vc}$…