FPT Algorithms for Consecutive Ones Submatrix Problems
From MaRDI portal
Publication:2867091
DOI10.1007/978-3-319-03898-8_25zbMath1309.68099MaRDI QIDQ2867091
N. S. Narayanaswamy, R. Subashini
Publication date: 10 December 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_25
68Q25: Analysis of algorithms and problem complexity
68W05: Nonnumerical algorithms
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)