Algorithms and complexity for geodetic sets on interval and chordal graphs - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Algorithms and complexity for geodetic sets on interval and chordal graphs

Résumé

We study the computational complexity of finding the geodetic number of a graph on chordal graphs and interval 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. We show that Minimum Geodetic Set is fixed parameter tractable for chordal graphs when parameterized by its tree-width (which equals its clique number). This implies a polynomial-time algorithm for k-trees, for fixed k. Then, we show that Minimum Geodetic Set is NP-hard on interval graphs, thereby answering a question of Ekim et al. (LATIN, 2012), who showed that Minimum Geodetic Set is polynomial-time solvable on proper interval graphs. 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.
Fichier principal
Vignette du fichier
Geodetic_set_of_chordal.pdf (693.2 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-04230514 , version 1 (06-10-2023)

Licence

Identifiants

  • HAL Id : hal-04230514 , version 1

Citer

Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Galhawat, Dimitri Lajou. Algorithms and complexity for geodetic sets on interval and chordal graphs. 2022. ⟨hal-04230514⟩
38 Consultations
25 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More