Hardness and approximation for the geodetic set problem in some graph classes
Publication:779181
DOI10.1007/978-3-030-39219-2_9zbMath1453.68127arXiv1909.08795OpenAlexW2974470551MaRDI QIDQ779181
Harmender Gahlawat, Bodhayan Roy, Florent Foucaud, Dibyayan Chakraborty, Subir Kumar Ghosh
Publication date: 21 July 2020
Full work available at URL: https://arxiv.org/abs/1909.08795
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Graph operations (line graphs, products, etc.) (05C76)
Related Items (7)
This page was built for publication: Hardness and approximation for the geodetic set problem in some graph classes