Classical complexity and fixed-parameter tractability of simultaneous consecutive ones submatrix \& editing problems

DOI10.1007/978-3-319-78455-7_12zbMATH Open1446.68078OpenAlexW2793842478MaRDI QIDQ777287

Mohith Jagalmohanan, R. Subashini, M. R. Rani

Publication date: 7 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-319-78455-7_12

zbMATH Keywords

parameterized complexitysimultaneous consecutive-ones property

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Classical complexity and fixed-parameter tractability of simultaneous consecutive ones submatrix \& editing problems