Semi-total domination in unit disk graphs
From MaRDI portal
Publication:6547828
DOI10.1007/978-3-031-52213-0_9MaRDI QIDQ6547828
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Bibliography on domination in graphs and some basic definitions of domination parameters
- A survey of selected recent results on total domination in graphs
- A better heuristic for orthogonal graph drawings
- Algorithmic aspects of semitotal domination in graphs
- A Vizing-type result for semi-total domination
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
- Semitotal domination in graphs
- Universality considerations in VLSI circuits
- Planar Formulae and Their Uses
- Simple heuristics for unit disk graphs
- Total Domination in Graphs
- Total Roman domination for proper interval graphs
- Topics in Domination in Graphs
- Semitotal domination in claw-free cubic graphs
- Approximation and Online Algorithms
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)
