FPT Algorithms for Domination in Biclique-Free Graphs

From MaRDI portal
Publication:2912896


DOI10.1007/978-3-642-33090-2_69zbMath1365.68291MaRDI QIDQ2912896

Jan Arne Telle, Yngve Villanger

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_69


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.)