FindingBipartiteComponentsinHypergraphs SupplementaryMaterial

Since the LP only gives partial assignment to the vertices'r-values, we solve the same LP on the reduced instance given by the setU \P. The formal description of our algorithm is given in Algorithm2. Secondly, we assume that the vertices inP have at least two differenty?-values. Notice thatbz preserves the relative ordering of the vertices and edges with respect tox? andy?,and allthe constraints in(5)hold forbz. These imply that bz is a feasible solution to(5) as well.