8 citations · 8 across the 1 of their papers we have counts for
2 papers
cs.DS2019
Algorithms for weighted independent transversals and strong colouring
Alessandra Graf, David G. Harris, Penny Haxell
An independent transversal (IT) in a graph with a given vertex partition is an independent set consisting of one vertex in each partition class. Several sufficient conditions are k…
math.CO2018★ 8 cited
Finding Independent Transversals Efficiently
Alessandra Graf, Penny Haxell
We give an efficient algorithm that, given a graph and a partition of its vertex set, finds either an independent transversal (an independent set $\{v_1,\ldots…