Treelength of series–parallel graphs - IDEX UCA JEDI Université Côte d'Azur Access content directly
Journal Articles Discrete Applied Mathematics Year : 2023

Treelength of series–parallel graphs

Abstract

The length of a tree-decomposition of a graph is the maximum distance (in the graph) between two vertices of a same bag of the decomposition. The treelength of a graph is the minimum length among its tree-decompositions. Treelength of graphs has been studied for its algorithmic applications in classical metric problems such as Traveling Salesman Problem or metric dimension of graphs and also, in compact routing in the context of distributed computing. Deciding whether the treelength of a general graph is at most 2 is NP-complete (graphs of treelength one are precisely the chordal graphs), and it is known that the treelength of a graph cannot be approximated up to a factor less than 3/2 (the best known approximation algorithm for treelength has an approximation ratio of 3). However, nothing is known on the computational complexity of treelength in planar graphs, except that the treelength of any outerplanar graph is equal to the third of the size of a largest isometric cycle. This work initiates the study of treelength in planar graphs by considering the next natural subclass of planar graphs, namely the one of series-parallel graphs. We first fully describe the treelength of melon graphs (set of pairwise internally disjoint paths linking two vertices), showing that, even in such a restricted graph class, the expression of the treelength is not trivial. Then, we show that treelength can be approximated up to a factor 3/2 in series-parallel graphs. Our main result is a quadratic-time algorithm for deciding whether a series-parallel graph has treelength at most 2. Our latter result relies on a characterization of series-parallel graphs with treelength 2 in terms of an infinite family of forbidden isometric subgraphs.
Fichier principal
Vignette du fichier
Series_parallel_graphs_of_treelength_2-4.pdf (624.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04268050 , version 1 (02-11-2023)

Identifiers

Cite

Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle. Treelength of series–parallel graphs. Discrete Applied Mathematics, 2023, 341, pp.16-30. ⟨10.1016/j.dam.2023.07.022⟩. ⟨hal-04268050⟩
82 View
17 Download

Altmetric

Share

Gmail Facebook X LinkedIn More