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

DOI10.1007/978-3-319-78455-7_12zbMath1446.68078MaRDI QIDQ777287

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

Publication date: 7 July 2020

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

zbMATH Keywords

parameterized complexity; simultaneous consecutive-ones property

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R05: Combinatorics in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q27: Parameterized complexity, tractability and kernelization