Login / Signup

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

M. R. RaniR. SubashiniMohith Jagalmohanan
Published in: Theor. Comput. Sci. (2020)
Keyphrases
  • fixed parameter tractable
  • parameterized complexity
  • computational problems
  • np complete
  • np hard
  • decision problems
  • database
  • special case
  • complex networks