The maximum distance-\(d\) independent set problem on unit disk graphs

DOI10.1007/978-3-319-78455-7_6zbMath1446.68119OpenAlexW2789268215MaRDI QIDQ777274

Ramesh K. Jallu, Subhas C. Nandy, Gautam K. Das, Sangram K. Jena

Publication date: 7 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-319-78455-7_6

zbMATH Keywords

independent setPTASunit disk graphdistance-\(d\) independent 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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

This page was built for publication: The maximum distance-\(d\) independent set problem on unit disk graphs