When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2020.7
URN: urn:nbn:de:0030-drops-133516
URL: https://drops.dagstuhl.de/opus/volltexte/2020/13351/
 Go to the corresponding LIPIcs Volume Portal

Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs

 pdf-format:

Abstract

We study the complexity of finding the geodetic number on subclasses of planar graphs and chordal graphs. A set S of vertices of a graph G is a geodetic set if every vertex of G lies in a shortest path between some pair of vertices of S. The Minimum Geodetic Set (MGS) problem is to find a geodetic set with minimum cardinality of a given graph. The problem is known to remain NP-hard on bipartite graphs, chordal graphs, planar graphs and subcubic graphs. We first study MGS on restricted classes of planar graphs: we design a linear-time algorithm for MGS on solid grids, improving on a 3-approximation algorithm by Chakraborty et al. (CALDAM, 2020) and show that MGS remains NP-hard even for subcubic partial grids of arbitrary girth. This unifies some results in the literature. We then turn our attention to chordal graphs, showing that MGS is fixed parameter tractable for inputs of this class when parameterized by their treewidth (which equals the clique number minus one). This implies a linear-time algorithm for k-trees, for fixed k. Then, we show that MGS is NP-hard on interval graphs, thereby answering a question of Ekim et al. (LATIN, 2012). As interval graphs are very constrained, to prove the latter result we design a rather sophisticated reduction technique to work around their inherent linear structure.

BibTeX - Entry

```@InProceedings{chakraborty_et_al:LIPIcs:2020:13351,
author =	{Dibyayan Chakraborty and Sandip Das and Florent Foucaud and Harmender Gahlawat and Dimitri Lajou and Bodhayan Roy},
title =	{{Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs}},
booktitle =	{31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages =	{7:1--7:15},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-173-3},
ISSN =	{1868-8969},
year =	{2020},
volume =	{181},
editor =	{Yixin Cao and Siu-Wing Cheng and Minming Li},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},