Finding minimum clique capacity (Q2392036)

Let \(C\) be a clique of a graph \(G\). The capacity of \(C\) is defined to be \((| V(G) \setminus C| + | D|)/2\), where \(D\) is the set of vertices in \(V(G) \setminus C\) that have both a neighbor and a non-neighbor in \(C\). The main result of this paper states that there is an algorithm, with running time \(O(n^{3.5})\), which with input an \(n\)-vertex graph \(G\), finds a clique \(C\) in \(G\) with minimum capacity.