Out-degree reducing partitions of digraphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2018

Out-degree reducing partitions of digraphs


Let k be a fixed integer. We determine the complexity of finding a p-partition (V1,. .. , Vp) of the vertex set of a given digraph such that the maximum out-degree of each of the digraphs induced by Vi, (1 ≤ i ≤ p) is at least k smaller than the maximum out-degree of D. We show that this problem is polynomial-time solvable when p ≥ 2k and N P-complete otherwise. The result for k = 1 and p = 2 answers a question posed in [3]. We also determine, for all fixed non-negative integers k1, k2, p, the complexity of deciding whether a given digraph of maximum out-degree p has a 2-partition (V1, V2) such that the digraph induced by Vi has maximum out-degree at most ki for i ∈ [2]. It follows from this characterization that the problem of deciding whether a digraph has a 2-partition (V1, V2) such that each vertex v ∈ Vi has at least as many neighbours in the set V3−i as in Vi, for i = 1, 2 is N P-complete. This solves a problem from [6] on majority colourings.
Fichier principal
Vignette du fichier
Maxreduce2part-revised.pdf (366.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01765642 , version 1 (13-04-2018)



Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo. Out-degree reducing partitions of digraphs. Theoretical Computer Science, 2018, 719, pp.64-72. ⟨10.1016/j.tcs.2017.11.007⟩. ⟨hal-01765642⟩
261 View
122 Download



Gmail Facebook Twitter LinkedIn More