Independent arborescences in acyclic digraphs
Statement
Let D=(V,A) be an acyclic digraph with designated root-nodes . Let be convex node sets with . Is it true that there exist independent -arborescences with if and only if there exist openly node-disjoint paths () for each ? (We call the and paths and openly node-disjoint if they are edge-disjoint and .)
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.