most citedA tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2011★ 2 cited

A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix

Mehrnoush Malekesmaeili, Cedric Chauve, Tamon Stephen

A binary matrix has the consecutive ones property (C1P) if it is possible to order the columns so that all 1s are consecutive in every row. In [McConnell, SODA 2004 768-777] the no…