On the mixed domination problem in graphs
DOI10.1016/j.tcs.2012.11.035zbMath1261.05079OpenAlexW2070924562MaRDI QIDQ1945934
James K. Lan, Gerard Jennhwa Chang
Publication date: 17 April 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.035
treetreesNP-completesplit graphscactuslinear time labeling algorithmmixed dominating setmixed domination problem
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (14)
This page was built for publication: On the mixed domination problem in graphs