Finding good 2-partitions of digraphs I. Hereditary properties - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2016

Finding good 2-partitions of digraphs I. Hereditary properties


We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote following two sets of natural properties of digraphs: H ={acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E ={strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of of deciding, for any fixed pair of positive integers k1, k2, whether a given digraph has a vertex partition into two digraphs D1, D2 such that |V (Di)| ≥ ki and Di has property Pi for i = 1, 2 when P1 ∈ H and P2 ∈ H ∪ E. We also classify the complexity of the same problems when restricted to strongly connected digraphs. The complexity of the problems when both P1 and P2 are in E is determined in the companion paper [2].
Fichier principal
Vignette du fichier
D2partH.pdf (356.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01327015 , version 1 (06-06-2016)



Jørgen Bang-Jensen, Frédéric Havet. Finding good 2-partitions of digraphs I. Hereditary properties. Theoretical Computer Science, 2016, 636, pp.85-94. ⟨10.1016/j.tcs.2016.05.029⟩. ⟨hal-01327015⟩
165 View
272 Download



Gmail Facebook Twitter LinkedIn More