The algorithmic complexity of the minus clique-transversal problem (Q2383654)

A minus clique-transversal function, MCTF for short, of a graph \(G=(V,E)\) is a function \(f:V\rightarrow \{-1,0,1\}\) such that \(\sum_{u\in V(C)}f(u)\geq 1\) for every clique \(C\) in \(G\). The weight of an MCTF \(f\) is \(\sum_{v\in V}f(v)\). The minus clique-transversal number of a graph \(G\) equals the minimum weight of an MCTF of \(G\). The upper minus clique-transversal number of a graph \(G\) equals to the maximum weight of a minimal MCTF of \(G\).