Vertex-edge domination in unit disk graphs

DOI10.1007/978-3-030-39219-2_6zbMath1453.68137OpenAlexW3002617111MaRDI QIDQ5896105

Sangram K. Jena, Gautam K. Das

Publication date: 21 July 2020

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

Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_6

zbMATH Keywords

approximation algorithmdominating setapproximation schemeunit disk graphvertex-edge dominating set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) 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) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Vertex-edge domination in cubic graphs

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