More results on weighted independent domination

DOI10.1016/j.tcs.2017.08.007zbMath1378.68088arXiv1602.09124MaRDI QIDQ2410364

Raffaele Mosca, Vadim V. Lozin, Victor Zamaraev, Dmitriy S. Malyshev

Publication date: 17 October 2017

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

Full work available at URL: https://arxiv.org/abs/1602.09124

zbMATH Keywords

polynomial-time algorithm; independent domination

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

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

05C22: Signed and weighted graphs