treewidth_directed (454B)
1 # Directed treewidth 2 3 directed treewidth, when it is bounded then the k-[disjoint_paths] problem is tractable, cf [kawarabayashi2022directed] 4 5 [kawarabayashi2022directed] shows that a [directed_graph] with high directed treewidth contains a [directed_grid] as [butterfly_minor] 6 - polynomial bounds known [hatzel2019polynomial] 7 8 Up: [treewidth], [width_measure_directed] 9 10 See also: [directed_pathwidth], [grid_minor_directed] 11 12 Aliases: Directed treewidth