期刊
DISCRETE APPLIED MATHEMATICS
卷 242, 期 -, 页码 26-33出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.dam.2017.11.004
关键词
Arborescence; Packing; Directed hypergraph; Matroid
资金
- Hungarian Scientific Research Fund-OTKA [K109240]
- Ministry of Human Capacities of Hungary [UNKP-17-4]
- internal project (RIME) of G-SCOP
We propose a further development in the theory of packing arborescences. First we review some of the existing results on packing arborescences and then we provide common generalizations of them to directed hypergraphs. We introduce and solve the problem of reachability-based packing of matroid-rooted hyperarborescences and we also solve the minimum cost version of this problem. Furthermore, we introduce and solve the problem of matroid-based packing of matroid-rooted mixed hyperarborescences. (C) 2017 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据