FPT Algorithms for Consecutive Ones Submatrix Problems

DOI10.1007/978-3-319-03898-8_25zbMath1309.68099OpenAlexW258974901MaRDI QIDQ2867091

R. Subashini, N. S. Narayanaswamy

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

zbMATH Keywords

parameterized complexityconsecutive ones propertyconsecutive ones submatrix

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Obtaining matrices with the consecutive ones property by row deletions

This page was built for publication: FPT Algorithms for Consecutive Ones Submatrix Problems