20 citations · 31 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2012★ 20 cited
The Parameterized Complexity of Domination-type Problems and Application to Linear Codes
David Cattanéo, Simon Perdrix
We study the parameterized complexity of domination-type problems. (sigma,rho)-domination is a general and unifying framework introduced by Telle: a set D of vertices of a graph G…
cs.CC2012★ 6 cited
Parametrized Complexity of Weak Odd Domination Problems
David Cattanéo, Simon Perdrix
Given a graph , a subset of vertices is a weak odd dominated (WOD) set if there exists such that every vertex in has an od…