Pages that link to "Item:Q3007640"

The following pages link to A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640):

Displaying 2 items.

• A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
• Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results (Q2297848) (← links)