Faster and Simpler Minimal Conflicting Set Identification

DOI10.1007/978-3-642-31265-6_4zbMath1358.68145arXiv1201.5513OpenAlexW1617356293MaRDI QIDQ2904477

Mathieu Raffinot, Aïda Ouangraoua

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.5513

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Graph representations (geometric and intersection representations, etc.) (05C62) Boolean and Hadamard matrices (15B34)

Related Items (1)

Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results

This page was built for publication: Faster and Simpler Minimal Conflicting Set Identification