Semi-total domination in unit disk graphs

DOI10.1007/978-3-031-52213-0_9MaRDI QIDQ6547828zbMATH OpenFDO

Authors Sasmita Rout, Gautam K. Das

Publication date 31 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-52213-0_9

zbMATH Keywords

approximation algorithmNP-completesemi-total dominating set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A better heuristic for orthogonal graph drawings
• A survey of selected recent results on total domination in graphs
• A Vizing-type result for semi-total domination
• Algorithmic aspects of semitotal domination in graphs
• Approximation and Online Algorithms
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Planar Formulae and Their Uses
• Semitotal domination in claw-free cubic graphs
• Semitotal domination in graphs
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
• Simple heuristics for unit disk graphs
• Topics in Domination in Graphs
• Total domination in graphs
• Total Roman domination for proper interval graphs
• Universality considerations in VLSI circuits

Cited in

(1)

• Semi-total domination in unit disk graphs and general graphs

This page was built for publication: Semi-total domination in unit disk graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547828)