Complexity results on the decomposition of a digraph into directed linear forests and out-stars - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2024

Complexity results on the decomposition of a digraph into directed linear forests and out-stars

Résumé

We consider two decomposition problems in directed graphs. We say that a digraph is $k$-bounded for some $k \in \mathbb{Z}_{\geq 1}$ if each of its connected components contains at most $k$ arcs. For the first problem, a directed linear forest is a collection of vertex-disjoint directed paths and we consider the problem of decomposing a given digraph into a $k$-bounded and an $\ell$-bounded directed linear forest for some fixed $k,\ell \in \mathbb{Z}_{\geq 1}\cup \{\infty\}$. We give a full dichotomy for this problem by showing that it can be solved in polynomial time if $k+\ell \leq 3$ and is NP-complete otherwise. This answers a question of Campbell, H\"orsch, and Moore. For the second problem, we say that an out-galaxy is a vertex-disjoint collection of out-stars. Again, we give a full dichotomy of when a given digraph can be edge-decomposed into a $k$-bounded and an $\ell$-bounded out-galaxy for fixed $k,\ell \in \mathbb{Z}_{\geq 1}\cup \{\infty\}$. More precisely, we show that the problem can be solved in polynomial time if $\min\{k,\ell\}\in \{1,\infty\}$ and is NP-complete otherwise.
Fichier principal
Vignette du fichier
2401.09202.pdf (467.14 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04471664 , version 1 (21-02-2024)

Licence

Paternité

Identifiants

Citer

Florian Hörsch, Lucas Picasarri-Arrieta. Complexity results on the decomposition of a digraph into directed linear forests and out-stars. 2024. ⟨hal-04471664⟩
7 Consultations
6 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More