A fixed-parameter tractable algorithm for matrix domination

  • Authors:

  • Mark Weston

  • Affiliations:

  • Department of Computer Science, University of Victoria, P.O. Box 3055, Victoria, BC, Canada

  • Venue:
  • Information Processing Letters
  • Year:
  • 2004

Quantified Score

Hi-index 0.89

Visualization

Abstract

MATRIX DOMINATION is the NP-complete problem of determining whether a given {0,1} matrix contains a set of k non-zero entries that are in the same row or same column as all other non-zero entries. Using a kernelization and search tree approach, we show the problem to be fixed-parameter tractable with running time O(n3 + 1.959kk5/2).