A fixed-parameter tractable algorithm for matrix domination
From MaRDI portal
Publication:2390264
DOI10.1016/j.ipl.2002.12.001zbMath1177.68103OpenAlexW2072543716MaRDI QIDQ2390264
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2002.12.001
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Parameterized Parallel Computing and First-Order Logic ⋮ Maximum matching and kernelization of edge dominating set
Cites Work