| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435851 | Theoretical Computer Science | 2015 | 13 Pages |
Abstract
We study out-branchings rooted at a given vertex s with the extra requirement that these satisfy certain balance conditions, such as balancing the number of arcs out of s, the number of vertices in each subtree of the branching etc. We obtain polynomial algorithms for several of the problems and study the borderline between polynomial and NP-complete special cases of the problems.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
J. Bang-Jensen, A. Yeo,