相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。Packing of maximal independent mixed arborescences
Hui Gao et al.
DISCRETE APPLIED MATHEMATICS (2021)
Packing branchings under cardinality constraints on their root sets
Hui Gao et al.
EUROPEAN JOURNAL OF COMBINATORICS (2021)
On reachability mixed arborescence packing
Tatsuya Matsuoka et al.
DISCRETE OPTIMIZATION (2019)
Old and new results on packing arborescences in directed hypergraphs
Quentin Fortier et al.
DISCRETE APPLIED MATHEMATICS (2018)
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings
Kristof Berczi et al.
MATHEMATICS OF OPERATIONS RESEARCH (2018)
ON MAXIMAL INDEPENDENT ARBORESCENCE PACKING
Csaba Kiraly
SIAM JOURNAL ON DISCRETE MATHEMATICS (2016)
MATROID-BASED PACKING OF ARBORESCENCES
Olivier Durand de Gevigney et al.
SIAM JOURNAL ON DISCRETE MATHEMATICS (2013)
ARC-DISJOINT IN-TREES IN DIRECTED GRAPHS
Naoyuki Kamiyama et al.
COMBINATORICA (2009)