Rémi Pellerin

collaborators

2 papers

cs.DS2022

A quasi-quadratic vertex Kernel for Cograph edge editing

Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé

We provide a $O (k^{2} log k)$ vertex kernel for cograph edge editing. This improves a cubic kernel found by Guillemot, Havet, Paul and Perez [1] which involved four reductio…

math.CO2022

Solution to a problem of Katona on counting cliques of weighted graphs

Peter Borg, Carl Feghali, Rémi Pellerin

A subset $I$ of the vertex set $V (G)$ of a graph $G$ is called a $k$ -clique independent set of $G$ if no $k$ vertices in $I$ form a $k$ -clique of $G$ . An independent set is a $2$ -c…