pseudoarboricity (364B)
1 # Pseudoarboricity 2 3 https://en.wikipedia.org/wiki/Pseudoforest#Algorithms 4 5 The minimum number of [pseudoforests] in which the [edges] of an [undirected_graph] can be partitioned, or the minimum k such that the [edges] can be [oriented] to form a [directed_graph] with [outdegree] at most k 6 - can be computed in [PTIME] 7 8 See also: [arboricity] 9 10 Up: [width_measure]