Complexity of the paired domination subdivision problem
From MaRDI portal
Publication:6101488
DOI10.22049/cco.2021.27010.1180zbMath1524.05206OpenAlexW3177599935MaRDI QIDQ6101488
Jafar Amjadi, Mustapha Chellali
Publication date: 1 June 2023
Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_14247_08ac472a3d6ffd5b00101026495496a4.pdf
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
This page was built for publication: Complexity of the paired domination subdivision problem