Isometric Path Complexity of Graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Isometric Path Complexity of Graphs

Résumé

A set S of isometric paths of a graph G is "v-rooted", where v is a vertex of G, if v is one of the end-vertices of all the isometric paths in S. The isometric path complexity of a graph G, denoted by ipco (G), is the minimum integer k such that there exists a vertex v ∈ V(G) satisfying the following property: the vertices of any isometric path P of G can be covered by k many v-rooted isometric paths. First, we provide an O(n² m)-time algorithm to compute the isometric path complexity of a graph with n vertices and m edges. Then we show that the isometric path complexity remains bounded for graphs in three seemingly unrelated graph classes, namely, hyperbolic graphs, (theta, prism, pyramid)-free graphs, and outerstring graphs. Hyperbolic graphs are extensively studied in Metric Graph Theory. The class of (theta, prism, pyramid)-free graphs are extensively studied in Structural Graph Theory, e.g. in the context of the Strong Perfect Graph Theorem. The class of outerstring graphs is studied in Geometric Graph Theory and Computational Geometry. Our results also show that the distance functions of these (structurally) different graph classes are more similar than previously thought. There is a direct algorithmic consequence of having small isometric path complexity. Specifically, using a result of Chakraborty et al. [ISAAC 2022], we show that if the isometric path complexity of a graph G is bounded by a constant k, then there exists a k-factor approximation algorithm for Isometric Path Cover, whose objective is to cover all vertices of a graph with a minimum number of isometric paths.
Fichier principal
Vignette du fichier
IPCO.pdf (631.47 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-04184516 , version 1 (22-08-2023)

Identifiants

Citer

Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès. Isometric Path Complexity of Graphs. 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), Aug 2023, Bordeaux, France. pp.32:1-32:14, ⟨10.4230/LIPIcs.MFCS.2023.32⟩. ⟨hal-04184516⟩
38 Consultations
20 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More