FPT algorithms for domination in sparse graphs and beyond

DOI10.1016/j.tcs.2018.10.030zbMath1421.68089MaRDI QIDQ1740694

Jan Arne Telle, Yngve Villanger

Publication date: 2 May 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.10.030

zbMATH Keywords

domination; parameterized algorithm; biclique-free graphs

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C42: Density (toughness, etc.)