树状结构的基本包装
Basic Packing of Arborescences
摘要：
我们提供了直接对应的加藤和谷川根树分解与拟阵约束的结果略有扩展。我们的结果特征有向图有一个包装的树与拟阵约束。它是Edmonds关于生成树形图的填充的结果的适当推广，并且使用Frank的一般定向结果，蕴含了Katoh和Tanigawa的上述结果。我们也给出了一个完整的描述的凸包的关联向量的基本包装的树状，并证明了最小成本版本的问题可以解决在多项式时间。
英文摘要：
We provide the directed counterpart of a slight extension of Katoh and Tanigawa's result on rooted-tree decompositions with matroid constraints. Our result characterises digraphs having a packing of arborescences with matroid constraints. It is a proper extension of Edmonds' result on packing of spanning arborescences and implies - using a general orientation result of Frank - the above result of Katoh and Tanigawa. We also give a complete description of the convex hull of the incidence vectors of the basic packings of arborescences and prove that the mimimum cost version of the problem can be solved in polynomial time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
