Vertex-edge domination in unit disk graphs

DOI10.1016/j.dam.2021.06.002zbMath1494.05084OpenAlexW3176538540MaRDI QIDQ5918769

Gautam K. Das, Sangram K. Jena

Publication date: 4 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.06.002

zbMATH Keywords

approximation algorithmdominating setapproximation schemeunit disk graphvertex-edge dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (1)

On \(k\)-vertex-edge domination of graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A better heuristic for orthogonal graph drawings
• A note on independent vertex-edge domination in graphs
• On \(ve\)-degrees and \(ev\)-degrees in graphs
• On \(ve\)-degree and \(ev\)-degree of graphs
• Bounds on the vertex-edge domination number of a tree
• APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS
• Minimum Dominating Set Problem for Unit Disks Revisited
• Complementary nil vertex edge dominating sets
• Universality considerations in VLSI circuits
• Efficient Planarity Testing
• Hamilton Paths in Grid Graphs
• Total vertex-edge domination
• On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs
• Double vertex-edge domination
• Vertex-edge domination in graphs
• Approximation and Online Algorithms
• Vertex-edge domination in graphs

This page was built for publication: Vertex-edge domination in unit disk graphs