Computing metric hulls in graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2017

Computing metric hulls in graphs

Résumé

We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This confirms a conjecture of Albenque and Knauer and implies that there is a polynomial time algorithm to compute the convex hull-number of a graph, when all its convex subgraphs are given as input. We then show that computing if the smallest preimage of a closed set is logarithmic in the size of the ground set is LOGSNP-complete if only the ground set is given. A special instance of this problem is computing the dimension of a poset given its linear extension graph, that was conjectured to be in P. The intent to show that the latter problem is LOGSNP-complete leads to several interesting questions and to the definition of the isometric hull, i.e., a smallest isometric subgraph containing a given set of vertices S. While for |S| = 2 an isometric hull is just a shortest path, we show that computing the isometric hull of a set of vertices is NP-complete even if |S| = 3. Finally, we consider the problem of computing the isometric hull-number of a graph and show that computing it is Σ P 2 complete.
Fichier principal
Vignette du fichier
metriccomplexities.pdf (469.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01612515 , version 1 (06-10-2017)
hal-01612515 , version 2 (30-07-2018)
hal-01612515 , version 3 (11-04-2019)
hal-01612515 , version 4 (23-05-2019)

Identifiants

  • HAL Id : hal-01612515 , version 1

Citer

Kolja Knauer, Nicolas Nisse. Computing metric hulls in graphs. [Research Report] Inria - Sophia Antipolis. 2017. ⟨hal-01612515v1⟩

Collections

LIF EC-MARSEILLE
538 Consultations
1009 Téléchargements

Partager

Gmail Facebook X LinkedIn More