1 paper
Alessandra Graf, Penny Haxell
We give an efficient algorithm that, given a graph G and a partition V1,…,Vm of its vertex set, finds either an independent transversal (an independent set $\{v_1,\ldots…